Abstrakt
It is known that the extension complexity of the TSP polytope for the complete graph is exponential in n even if the subtour inequalities are excluded. In this article we study the polytopes formed by removing other subsets of facet-defining inequalities of the TSP polytope.
In particular, we consider the case when is either the set of blossom inequalities or the simple comb inequalities. These inequalities are routinely used in cutting plane algorithms for the TSP.
We show that the extension complexity remains exponential even if we exclude these inequalities. In addition we show that the extension complexity of polytope formed by all comb inequalities is exponential.
For our proofs, we introduce a subclass of comb inequalities, called (h, t)-uniform inequalities, which may be of independent interest.