The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research
| Hi-index | 0.00 |
In this paper we present a tour of the symmetric traveling salesman polytope, focusing on inequalities that can be defined on sets of nodes. Most widely known inequalities are of this type. Many papers have appeared that give increasingly complex valid inequalities for this polytope, but little intuition on why these inequalities are valid has been given.To help in understanding these inequalities, we develop an intuition into their validity by giving a unifying way of defining them through a sequential lifting procedure. This procedure is based on lifting the slack variables associated with subtour elimination inequalities defined on sets of nodes (called teeth). We apply this procedure to some known classes of valid inequalities for the traveling salesman polytope (TSP) respectively comb, brush, star, path, and bipartition inequalities, where the lifting coefficients are sequence independent. For comb, star, and bipartition inequalities, we provide new and noninductive proofs of validity directly inspired by this lifting procedure. We also give an example where a facet-defining inequality is derived from the lifting procedure, but where the lifting coefficients are sequence dependent. We finally study the ladder inequalities and show that they can be generated by an extension of the general procedure, where the lifted variables are different from the slack variables of subtour elimination inequalities.