A new class of cutting planes for the symmetric travelling salesman problem (Q1107441)

A class of inequalities, called ``star-constraints'', is introduced and shown to yield valid inequalities for the classical symmetric as well as the graphical travelling salesman polytope. The class contains the comb-, path-, bicycle- and wheelbarrow-inequalities as special cases. It is, however, disinct from the clique-tree inequalities. Sufficient conditions are stated under which these star-constraints define facets of the graphical travelling salesman polytope.