A Lower Bound for Adjacencies on the Traveling Salesman Polytope.
Aravamuthan SarangarajanPublished in: SIAM J. Discret. Math. (1997)
Keyphrases
- traveling salesman
- lower bound
- quadratic assignment problem
- upper bound
- branch and bound
- branch and bound algorithm
- lattice points
- stable set
- traveling salesman problem
- np hard
- lower and upper bounds
- convex hull
- optimal solution
- worst case
- lagrangian relaxation
- semidefinite
- objective function
- knapsack problem
- global optimization
- linear programming
- sufficiently accurate
- linear programming relaxation
- facet defining inequalities