The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities.
Denis NaddefGiovanni RinaldiPublished in: Math. Program. (1991)
Keyphrases
- valid inequalities
- linear programming relaxation
- lagrangian relaxation
- integrality gap
- integer programming
- lp relaxation
- traveling salesman problem
- mixed integer programming
- mixed integer
- linear programming
- lower and upper bounds
- mixed integer linear programs
- feasible solution
- cutting plane algorithm
- column generation
- cutting plane
- continuous relaxation
- randomly generated problems
- integer program
- integer programming formulation
- network design problem
- convex hull
- primal dual
- lower bound
- integer variables
- knapsack problem
- facet defining inequalities
- np hard
- continuous variables
- upper bound
- objective function
- optimal solution
- branch and bound algorithm
- dynamic programming
- probabilistic model
- combinatorial optimization