A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases.
Maximilian JohnAndreas KarrenbauerPublished in: ISCO (2016)
Keyphrases
- quadratic assignment problem
- integrality gap
- lower bound
- semidefinite
- semi definite programming
- linear programming relaxation
- semidefinite programming
- tabu search
- combinatorial optimization
- convex relaxation
- integer linear programming formulation
- branch and bound algorithm
- knapsack problem
- lagrangian relaxation
- linear programming
- objective function
- convex optimization
- neural network
- evolutionary algorithm
- linear program
- semi supervised learning
- stochastic local search
- search algorithm