Abstract
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 Chvàtal, Grötschel and Padberg, the clique tree inequalities of Grötschel and Pulleyblank, the path inequalities of Cornuéjols, 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
