Not Every GTSP Facet Induces an STSP Facet

DOI10.1007/11496915_34zbMATH Open1119.90364OpenAlexW1538945240MaRDI QIDQ3596367FDOQ3596367

Marcus Oswald, Dirk Oliver Theis, Gerhard Reinelt

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_34

Recommendations

• On the graphical relaxation of the symmetric traveling salesman polytope
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
• The symmetric generalized traveling salesman polytope
• The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities

zbMATH Keywords

polyhedral computationpolyhedral combinatoricsfacetsGraphical Traveling Salesman ProblemSymmetric Traveling Salesman Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (3)

• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
• Local cuts revisited
• On the facial structure of symmetric and graphical traveling salesman polyhedra

This page was built for publication: Not Every GTSP Facet Induces an STSP Facet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596367)