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”.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
