Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem.
Samuel C. GutekunstDavid P. WilliamsonPublished in: CoRR (2019)
Keyphrases
- integrality gap
- subtour elimination
- lp relaxation
- traveling salesman problem
- valid inequalities
- linear programming
- linear program
- linear programming relaxation
- message passing
- optimal solution
- feasible solution
- knapsack problem
- integer programming
- energy minimization
- combinatorial optimization
- integer program
- optimization problems
- ant colony optimization
- dynamic programming
- maximum a posteriori
- arbitrarily close
- multi objective
- objective function
- upper bound
- belief propagation
- mathematical model
- finite number
- primal dual
- distributed systems