Abstract
Many important cutting planes have been discovered for the traveling salesman problem. Among them are the clique tree inequalities and the more general bipartition inequalities. Little is known in the way of exact algorithms for separating these inequalities in polynomial time in the size of the fractional point X* which is being separated. An algorithm is presented here that separates bipartition inequalities of a fixed number of handles and teeth, which includes clique tree inequalities of a fixed number of handles and teeth, in polynomial time.
Sign-in/Register to access full text options 
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.
