Semidefinite Programming Relaxations for the Quadratic Assignment Problem.
Qing ZhaoStefan E. KarischFranz RendlHenry WolkowiczPublished in: J. Comb. Optim. (1998)
Keyphrases
- quadratic assignment problem
- semidefinite programming
- semidefinite
- lower bound
- linear programming
- quadratically constrained quadratic
- interior point methods
- tabu search
- linear programming relaxation
- primal dual
- combinatorial optimization
- upper bound
- maximum margin
- kernel matrix
- np hard
- optimal solution
- linear program
- learning algorithm
- feasible solution
- scheduling problem
- stochastic local search
- objective function
- column generation
- dynamic programming
- feature space