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.
Preview
Unable to display preview. Download preview PDF.
References
S. C. Boyd and W. H. Cunningham (1991), Small travelling salesman polytopes, Mathematics of Operations Research 16, 259–271
M. Grotschel and W. R. Pulleyblank (1986), Clique tree inequalities and the symmetric traveling salesman problem, Mathematics of Operations Research 11, 537–569
M. Junger, G. Reinelt, and G. Rinaldi (1994), The traveling salesman problem, Istituto Di Analisi Dei Sistemi Ed Informatica, R. 375, p. 64
M. W. Padberg and M.R. Rao (1982), Odd minimum cut sets and b-matchings, Math. Oper. Res. 7, 67–80
M. Padberg and G. Rinaldi (1990), Facet identification for the symmetric traveling salesman polytope, Mathematical Programming 47 219–257
D. Naddef (1992), The binested inequalities for the symmetric traveling salesman polytope, Mathematics of Operations Research, Vol. 17, No. 4, Nov.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carr, R.D. (1995). Separating clique tree and bipartition inequalities in polynomial time. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_40
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive