A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
Alain FayeFrédéric RoupinPublished in: ESA (2005)
Keyphrases
- quadratic assignment problem
- optimal solution
- objective function
- semidefinite
- cutting plane
- np hard
- dynamic programming
- knapsack problem
- search space
- supervised learning
- worst case
- simulated annealing
- linear programming
- combinatorial optimization
- computational complexity
- convergence rate
- linear programming relaxation
- learning algorithm
- expectation maximization
- np complete
- high dimensional