Abstract
We propose a new procedure of facet composition for the Symmetric Traveling Salesman Polytope(STSP). Applying this procedure to the well-known comb inequalities, we obtain completely or partially known classes of inequalities like clique-tree, star, hyperstar, ladder inequalities for STSP. This provides a proof that a large subset of hyperstar inequalities which are until now only known to be valid, are indeed facets defining inequalities of STSP and this also generalizes ladder inequalities to a larger class. Finally, we describe some new facet defining inequalities obtained by applying the procedure.
Current address: LIP6, 4 place Jussieu 75005 Paris
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Boyd, W. Cunningham, M. Queyranne, and Y. Wang. Ladders for travelling salesmen. SIAM Journal on Optimization, 5:408–420, 1995.
V. Chvátal. Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming, 5:29–40, 1973.
B. Fleischman. Cutting planes for the symmetric traveling salesman problem. Technical report, Universitat Hamburg, 1987.
B. Fleischman. A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming, 40:225–246, 1988.
M. Grötschel and M. Padberg. On the symmetric traveling salesman problem I: inequalities. Mathematical Programming, 16:265–280, 1979.
M. Grötschel and W. Pulleyblank. Clique tree inequalities and the symmetric traveling salesman problem. Mathematics of operations research, 11:537–569, 1986.
M. Jünger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, Handbook on Operations Research and Management Science, pages 225–330. North Holland, 1995.
D. Naddef and G. Rinaldi. The symmetric traveling salesman polytope: new facets from the graphical relaxation. Technical Report 248, Instituto di Analisi dei Sistemi ed Informatica, 1988.
D. Naddef and G. Rinaldi. The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Mathematical Programming, 58:53–88, 1993.
D. Naddef. Handles and teeth in the symmetric traveling salesman polytope. In W. Cook and P. Seymour, editors, Polyhedral Combinatorics, volume 1, pages 61–74. DIMACS series in Discrete Mathematics and Theoretical of Computer Science, AMS-ACM, 1990.
V. H. Nguyen. Polyèdres de cycles: Description, Composition et Lifting de Facettes. PhD thesis, Université de la Méditerranée, Marseille, 2000.
M. Queyranne and Y. Wang. Facet-tree composition for symmetric travelling salesman polytopes. Technical Report 90-MSC-001, Faculty of Commerce and Business Administration, University of British Columbia, 1990.
M. Queyranne and Y. Wang. Composing facets of symmetric travelling salesman polytopes. Technical report, Faculty of Commerce and Business Administration, University of British Columbia, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Maurras, J.F., Nguyen, V.H. (2003). A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds) Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science, vol 2570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36478-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-36478-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00580-3
Online ISBN: 978-3-540-36478-8
eBook Packages: Springer Book Archive