The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem.
Samuel C. GutekunstDavid P. WilliamsonPublished in: SIAM J. Optim. (2018)
Keyphrases
- traveling salesman problem
- semidefinite
- integrality gap
- valid inequalities
- linear programming relaxation
- semidefinite programming
- combinatorial optimization
- optimization problems
- convex relaxation
- interior point methods
- ant colony optimization
- sufficient conditions
- lp relaxation
- higher dimensional
- linear program
- linear programming
- knapsack problem
- convex sets
- pairwise
- approximation algorithms
- upper bound
- integer program
- primal dual
- globally optimal
- special case
- evolutionary algorithm
- quadratic assignment problem
- lower bound