Instance-based algorithm selection on quadratic assignment problem landscapes.
Andreas BehamMichael AffenzellerStefan WagnerPublished in: GECCO (Companion) (2017)
Keyphrases
- quadratic assignment problem
- computational complexity
- learning algorithm
- np hard
- dynamic programming
- linear programming
- randomly generated
- objective function
- simulated annealing
- computationally efficient
- ant colony optimization
- cost function
- probabilistic model
- combinatorial optimization
- benchmark problems
- test problems