The Crown Inequalities for the Symmetric Traveling Salesman Polytope

DOI10.1287/moor.17.2.308zbMath0771.52006OpenAlexW2086315201WikidataQ58002944 ScholiaQ58002944MaRDI QIDQ4016696

Giovanni Rinaldi, Denis Naddef

Publication date: 16 January 1993

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

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

zbMATH Keywords

linear inequalitiessymmetric travelling salesman polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Paths and cycles (05C38)

Related Items

The pickup and delivery problem: Faces and branch-and-cut algorithm, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, A complete description of the traveling salesman polytope on 8 nodes, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, Combinatorial optimization and small polytopes, Survey of facial results for the traveling salesman polytope