Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation

DOI10.1287/moor.1030.0058zbMath1082.90142OpenAlexW2110771610MaRDI QIDQ5704160

No author found.

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1030.0058

zbMATH Keywords

inequalitiespolyhedronpolytopeseparationsymmetric traveling salesman problemlifting, node lifting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the graphical relaxation of the symmetric traveling salesman polytope ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone ⋮ On the facial structure of symmetric and graphical traveling salesman polyhedra

This page was built for publication: Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation