A multi-start heuristic for multiplicative depth minimization of boolean circuits.
Sergiu CarpovPascal AubryRenaud SirdeyPublished in: IACR Cryptol. ePrint Arch. (2017)
Keyphrases
- multi start
- iterated local search
- tabu search
- global optimization
- stochastic approximation
- vehicle routing problem with time windows
- metaheuristic
- path relinking
- variable neighborhood descent
- simulated annealing
- search algorithm
- feasible solution
- max min
- heuristic methods
- memetic algorithm
- neural network
- scheduling problem
- optimal solution
- genetic algorithm