Abstract
This paper solves, in the affermative, the open question of whether the Grötschel-Pulleyblank clique tree inequalities define facets of the asymmetric traveling salesman polytope and its monotonization. This generalizes the corresponding result for symmetric polytopes. The proof makes use of a new recursive definition of clique tree, based on induction on the number of its “teeth” rather than of its “handles”.
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.
