Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem.
Kurt M. AnstreicherPublished in: SIAM J. Optim. (2000)
Keyphrases
- semidefinite
- quadratic assignment problem
- lower bound
- upper bound
- semidefinite programming
- sufficient conditions
- convex relaxation
- interior point methods
- branch and bound
- tabu search
- combinatorial optimization
- convex sets
- higher dimensional
- optimal solution
- objective function
- decision trees
- test instances
- linear programming
- column generation
- worst case
- np hard
- pairwise
- stochastic local search