On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
Dirk Oliver Theis

TL;DR
This paper investigates the relationship between the symmetric and graphical Traveling Salesman Polytopes, focusing on how valid inequalities can be transferred between them and revealing connections to polyhedral properties.
Contribution
It introduces a method for lifting inequalities from the symmetric to the graphical TSP polytope and uncovers a link between relaxation properties and ridge graph connectivity.
Findings
Valid inequalities can be 'lifted' from $S_n$ to $P_n$.
A connection between relaxations and ridge graph connectivity is established.
The study provides new insights into the polyhedral structure of TSP polytopes.
Abstract
The Symmetric Traveling Salesman Polytope for a fixed number of cities is a face of the corresponding Graphical Traveling Salesman Polyhedron . This has been used to study facets of using as a tool. In this paper, we study the operation of "rotating" (or "lifting") valid inequalities for to obtain a valid inequalities for . As an application, we describe a surprising relationship between (a) the parsimonious property of relaxations of the Symmetric Traveling Salesman Polytope and (b) a connectivity property of the ridge graph of the Graphical Traveling Salesman Polyhedron.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Optimization and Packing Problems
