Annealing placement by thermodynamic combinatorial optimization.
Juan de VicenteJuan LancharesRomán HermidaPublished in: ACM Trans. Design Autom. Electr. Syst. (2004)
Keyphrases
- combinatorial optimization
- simulated annealing
- metaheuristic
- combinatorial optimization problems
- evolutionary algorithm
- tabu search
- traveling salesman problem
- branch and bound
- genetic algorithm
- branch and bound algorithm
- combinatorial problems
- benchmark problems
- mathematical programming
- experimental data
- optimization problems
- quadratic assignment problem
- path relinking
- vehicle routing problem
- hard combinatorial optimization problems
- search procedure
- graph theory
- memetic algorithm
- special case
- search space
- pairwise
- lower bound