THE BINESTED INEQUALITIES FOR THE SYMMETRICAL TRAVELING SALESMAN POLYTOPE

In this paper we define a family of valid inequalities for the Symmetric Travelling Salesman Polytope which are defined on two nested sets of vertices of the graph. These inequalities generalize the comb inequalities of Chvatal, Grotschel and Padberg, the clique tree inequalities of Grotschel and Pulleyblank, the path inequalities of Cornuejols, Fonlupt and Naddef and the hyperstar inequalities of Fleischman. This is the largest known family of valid inequalities known so far. Facet inducing inequalities for the Symmetric Travelling Salesman Polytope contained in this class and in no other one are given proving that this is a proper generalization of the previously mentioned families.