Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm
Alexandre Domingues GonçalvesLúcia Maria de A. DrummondArtur Alves PessoaPeter M. HahnPublished in: CoRR (2013)
Keyphrases
- quadratic assignment problem
- lower bound
- objective function
- np hard
- optimal solution
- learning algorithm
- linear programming
- search space
- computational complexity
- dynamic programming
- worst case
- simulated annealing
- ant colony optimization
- aco algorithm
- combinatorial optimization
- exact solution
- decision trees
- special case
- network flow
- memetic algorithm
- randomly generated
- linear program
- computational efficiency
- tabu search