Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem.
Etienne de KlerkRenata SotirovPublished in: Math. Program. (2010)
Keyphrases
- semidefinite programming
- quadratic assignment problem
- semidefinite
- linear programming
- lower bound
- quadratically constrained quadratic
- interior point methods
- tabu search
- combinatorial optimization
- kernel matrix
- primal dual
- upper bound
- test instances
- linear program
- linear programming relaxation
- maximum margin
- np hard
- simulated annealing
- worst case
- graphical models
- metaheuristic
- neural network