Using well-solvable quadratic assignment problems for VLSI interconnect applications.
Ben EmanuelShmuel WimerGershon WolanskyPublished in: Discret. Appl. Math. (2012)
Keyphrases
- quadratic assignment problem
- high speed
- power dissipation
- lower bound
- hybrid genetic algorithm
- np hard
- special case
- np complete
- power consumption
- tabu search
- low power
- combinatorial optimization
- dynamic programming
- test instances
- aco algorithm
- stochastic local search
- genetic algorithm
- ant colony optimization
- evolutionary algorithm
- computational complexity
- orders of magnitude
- cost function