A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits.
Sergiu CarpovPascal AubryRenaud SirdeyPublished in: IWOCA (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
- objective function
- simulated annealing
- monte carlo
- scheduling problem
- genetic algorithm
- shortest path
- least squares
- feasible solution
- heuristic methods
- dynamic programming
- search algorithm
- optimal solution