Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem.
Samuel C. GutekunstDavid P. WilliamsonPublished in: SIAM J. Discret. Math. (2019)
Keyphrases
- integrality gap
- subtour elimination
- traveling salesman problem
- valid inequalities
- lp relaxation
- linear programming relaxation
- linear programming
- linear program
- message passing
- knapsack problem
- combinatorial optimization
- feasible solution
- integer programming
- optimization problems
- energy minimization
- optimal solution
- ant colony optimization
- maximum a posteriori
- traveling salesman
- solution quality
- integer program
- approximate solutions
- network flow
- lower bound
- primal dual
- global constraints
- column generation
- belief propagation
- constraint satisfaction
- markov random field