Abstract
Letchford (2000) introduced the domino-parity inequalities for the symmetric traveling salesman problem and showed that if the support graph of an LP solution is planar, then the separation problem can be solved in polynomial time. We generalize domino-parity inequalities to multi-handled configurations, introducing a superclass of bipartition and star inequalities. Also, we generalize Letchford’s algorithm, proving that for a fixed integer k, one can separate a superclass of k-handled clique-tree inequalities satisfying certain connectivity characteristics with respect to the planar support graph. We describe an implementation of Letchford’s algorithm including pruning methods to restrict the search for dominoes, a parallelization of the main domino-building step, heuristics to obtain planar-support graphs, a safe-shrinking routine, a random-walk heuristic to extract additional violated constraints, and a tightening procedure to allow us to modify existing inequalities as the LP solution changes. We report computational results showing the strength of the new routines, including the optimal solution of the TSPLIB instance pla33810.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians, pp. 645–656 (1998)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathematical Programming 97, 91–153 (2003)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)
Boyd, S., Cockburn, S., Vella, D.: On the domino-parity inequalities for the STSP. Computer Science Technical Report TR-2001-10. University of Ottawa (2001)
Boyer, J.M., Myrvold, W.: On the cutting edge: simplified O(n) planarity by edge addition. Journal of Graph Algorithms and Applications (2004) (to appear)
Chvátal, V.: Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming 5, 29–40 (1973)
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling salesman problem. Operations Research 2, 393–410 (1954)
Fleischer, L., Tardos, É.: Separating maximally violated comb inequalities in planar graphs. Mathematics of Operations Research 24, 130–148 (1999)
Grötschel, M., Holland, O.: Solution of large-scale symmetric travelling salesman problems. Mathematical Programming 51, 141–202 (1991)
Grötschel, M., Pulleyblank, W.R.: Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research 11, 537–569 (1986)
Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126, 106–130 (2000)
Jünger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Ball, M., Magnanti, T., Monma, C.L., Nemhauser, G. (eds.) Handbooks on Operations Research and Management Sciences: Networks, pp. 225–330. North Holland, Amsterdam (1995)
Letchford, A.N.: Separating a superclass of comb inequalities in planar graphs. Mathematics of Operations Research 25, 443–454 (2000)
Naddef, D.: Polyhedral theory and branch-and-cut algorithms for the symmetric traveling salesman problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 29–116. Kluwer, Dordrecht (2002)
Nagamochi, H., Nishimura, K., Ibaraki, T.: Computing all small cuts in undirected networks. SIAM Journal on Discrete Mathematics 10, 469–481 (1997)
Naddef, D., Thienel, S.: Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Mathematical Programming 92, 257–283 (2002)
Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Mathematics of Operations Research 7, 67–80 (1982)
Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33, 60–100 (1991)
Tamaki, H.: Alternating cycle contribution: a tour-merging strategy for the travelling salesman problem. Max-Planck Institute Research Report MPI-I-2003-1-007. Saarbrücken, Germany (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cook, W., Espinoza, D., Goycoolea, M. (2005). A Study of Domino-Parity and k-Parity Constraints for the TSP. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_33
Download citation
DOI: https://doi.org/10.1007/11496915_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)