A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP.
Anna KarlinNathan KleinShayan Oveis GharanPublished in: FOCS (2022)
Keyphrases
- integrality gap
- lp relaxation
- subtour elimination
- linear programming relaxation
- lower bound
- traveling salesman problem
- linear program
- linear programming
- valid inequalities
- message passing
- optimal solution
- integer programming
- feasible solution
- energy minimization
- arbitrarily close
- search space
- approximation algorithms
- np hard
- genetic algorithm
- global constraints
- primal dual
- vc dimension
- graph cuts
- worst case
- upper bound
- objective function