Mathematical Programming: Series A and B
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope
Mathematical Programming: Series A and B
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation
Mathematics of Operations Research
On the graphical relaxation of the symmetric traveling salesman polytope
Mathematical Programming: Series A and B
Hi-index | 0.04 |
In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This follows almost trivially from known facts. There are nonetheless two reasons why we find this observation worth communicating: It is very surprising; it helps us understand the relationship between these two important families of polyhedra.