Not Every GTSP Facet Induces an STSP Facet
From MaRDI portal
Publication:3596367
DOI10.1007/11496915_34zbMath1119.90364MaRDI QIDQ3596367
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
polyhedral computation; facets; polyhedral combinatorics; Graphical Traveling Salesman Problem; Symmetric Traveling Salesman Problem
Related Items
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