Worst-case comparison of valid inequalities for the TSP.
Michel X. GoemansPublished in: Math. Program. (1995)
Keyphrases
- valid inequalities
- traveling salesman problem
- worst case
- integer programming
- np hard
- combinatorial optimization
- ant colony optimization
- cutting plane algorithm
- mixed integer linear programs
- linear programming
- randomly generated problems
- optimization problems
- network design problem
- lower bound
- primal dual
- integer programming formulation
- lower and upper bounds
- mixed integer programming
- linear programming relaxation
- column generation
- cutting plane
- integer program
- lagrangian relaxation
- approximation algorithms
- convex hull
- upper bound
- facet defining inequalities
- learning algorithm
- transportation networks
- greedy algorithm
- special case
- optimal solution