On the Integrality Ratio of the Subtour LP for Euclidean TSP.
Stefan HougardyPublished in: CoRR (2014)
Keyphrases
- subtour elimination
- lp relaxation
- linear programming
- linear program
- message passing
- optimal solution
- integer programming
- knapsack problem
- feasible solution
- energy minimization
- integer program
- mixed integer
- extreme points
- maximum a posteriori
- traveling salesman problem
- np hard
- euclidean space
- global constraints
- objective function
- standard deviation
- distributed systems
- data sets
- column generation
- euclidean distance
- scheduling problem
- particle swarm optimization
- constraint programming
- graph cuts
- valid inequalities
- linear programming relaxation
- search space
- simplex method
- euclidean metric
- tabu search