Skip to main content
SpringerLink
Log in

Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1610))

Abstract

In this paper the symmetric traveling salesman problem (STSP) is modeled as a problem of discrete semidefinite programming. A class of semidefinite relaxations of STSP model is defined and two variants of a branch-and-bound technique based on this class of relaxations are proposed. The results of preliminary numerical experiments with randomly generated problems are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borchers, B.: CSDP, A C Library for Semidefinite Programming. Optimization Methods and Software (to appear)

    Google Scholar 

  2. Carpaneto G., Fischetti M., Toth P.: New Lower Bounds for the Symmetric Travelling Salesman Problem. Math. Program. 45 (1989) 233–254.

    Article  MATH  MathSciNet  Google Scholar 

  3. Christofides N.: The Shortest Hamiltonian Chain of a Graph. SIAM J. Appl. Math. 19 (1970) 689–696.

    Article  MathSciNet  Google Scholar 

  4. Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. John Wiley & Sons, New York Chichester Weinheim Brisbane Singapore Toronto (1998)

    MATH  Google Scholar 

  5. Crowder H., Padberg M.W.: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality. Management Sci. 26 (1980) 495–509

    MATH  MathSciNet  Google Scholar 

  6. Cvetković, D., Čangalović, M., Dimitrijević, V., Kraus, L., Milosavljević, M., Simić, S.: TSP-SOLVER-A Programming Package for the Traveling Salesman Problem. Univ. Beograd, Publ. Elektrotehn. Fak. Ser. Mat., 1 (1990) 41–47

    MATH  Google Scholar 

  7. Cvetković, D., Čangalović, M., Kovačević-Vujčić, V.: Semidefinite Programming and Traveling Salesman Problem. In: Petrović, R., Radojević, D. (eds.): Proceedings of Yugoslav Symposium on Operations Research. Herceg Novi, Yugoslavia (1998) 239–242

    Google Scholar 

  8. Cvetković, D., Čangalović, M., Kovačević-Vujčić, V.: Semidefinite Relaxations of Travelling Salesman Problem. (to appear)

    Google Scholar 

  9. Cvetković, D., Dimitrijević, V., Milosavljević, M.: Variations on the Travelling Salesman Theme. Libra Produkt, Belgrade (1996)

    Google Scholar 

  10. Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs. 3rd edn. Johann Ambrosius Barth, Heidelberg Leipzig (1995)

    MATH  Google Scholar 

  11. Dantzig G.B., Fulkerson D.R., Johnson S.M.: Solution of a Large-Scale Traveling Salesman Problem. Operations Research 2 (1954) 393–410

    MathSciNet  Google Scholar 

  12. Fiedler M.: Algebraic Connectivity of Graphs. Czechoslovak Math. J. 23 (1973) 298–305

    MathSciNet  Google Scholar 

  13. Fiedler, M.: Laplacian of Graphs and Algebraic Connectivity. In: Combinatorics and Graph Theory, Vol. 25, Banach center publications, PWN-Polish scientific publishers Warsaw (1989) 57–70

    MathSciNet  Google Scholar 

  14. Gavish B., Srikanth K.N.: An Optimal Solution Method for Large-Scale Multiple Travelling Salesman Problems. Operations Research 34 (1986) 698–717

    Article  MATH  MathSciNet  Google Scholar 

  15. Goemans, M.: Semidefinite Programming in Combinatorial Optimization. Math. Program. 79 (1997) 143–161

    Article  MathSciNet  Google Scholar 

  16. Goemans M.X., Williamson D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfability Problems Using Semidefinite Programming. J. ACM 42 (1995) 1115–1145

    Article  MATH  MathSciNet  Google Scholar 

  17. Grötschel M., Holland O.: Solution of Large-Scale Symmetric Travelling Salesman Problems. Math. Program. 51 (1991) 141–202

    Article  MATH  Google Scholar 

  18. Helbig-Hansen K., Krarup J.: Improvements of the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem. Math. Program. 7 (1974) 87–96

    Article  MATH  MathSciNet  Google Scholar 

  19. Held M., Karp R.M.: The Travelling Salesman Problem and Minimum Spanning Trees. Part II, Math. Program. 1 (1971) 6–25

    MATH  MathSciNet  Google Scholar 

  20. Karger D., Motwani R., Sudan M.: Approximate Graph Coloring by Semidefinite Programming. J. ACM 45 (1998) 246–265

    Article  MATH  MathSciNet  Google Scholar 

  21. Land A.H.: The Solution of Some 100-City Travelling Salesman Problems. Working Paper. London School of Economics (1979)

    Google Scholar 

  22. Laporte, G.: The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms. European J. Operational Research 59 (1992) 231–247

    Article  MATH  Google Scholar 

  23. Laporte G.: Exact Algorithms for the Traveling Salesman Problem and the Vehicle Routing Problem. Les Cahiers du GERAD G-98-37 July (1998)

    Google Scholar 

  24. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. John Wiley & Sons, Chichester New York Brisbane Toronto Singapore (1985)

    MATH  Google Scholar 

  25. Martin G.T.: Solving the Travelling Salesman Problem by Integer Programming. Working Paper. CEIR, New York (1966)

    Google Scholar 

  26. Miliotis P.: Integer Programming Approaches to the Travelling Salesman Problem. Math. Program. 10 (1976) 367–378

    Article  MATH  MathSciNet  Google Scholar 

  27. Miliotis P.: Using Cuting Planes to Solve the Symmetric Travelling Salesman Problem. Math. Program. 15 (1978) 177–188

    Article  MATH  MathSciNet  Google Scholar 

  28. Padberg M.W., Hong S.: On the Symmetric Travelling Salesman Problem: A Computational Study. Math. Program. Study 12 (1980) 78–107

    MATH  MathSciNet  Google Scholar 

  29. Padberg M.W., Rinaldi G.: Optimization of a 532-City Symmetric Traveling Salesman Problem by Branch and Cut. Operations Research Letters 6 (1987) 1–7

    Article  MATH  MathSciNet  Google Scholar 

  30. Padberg M.W., Rinaldi G.: A Branch-and-Cut Algorithm for the Resolution of Large Scale Symmetric Traveling Salesman Problems. SIAM Review 33 (1991) 66–100

    Article  MathSciNet  Google Scholar 

  31. Rendl, F.: Semidefinite Programming and Combinatorial Optimization. Technical Report Woe-19, TU Graz, Austria December (1997)

    Google Scholar 

  32. Smith T.H.C., Thompson G.L.: A LIFO Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp’s 1-Tree Relaxation. Annals Disc. Math. 1 (1977) 479–493

    Article  MathSciNet  Google Scholar 

  33. Vandenberghe, L., Boyd, S.: Semidefinite Programming. SIAM Review 38 (1996) 49–95

    Article  MATH  MathSciNet  Google Scholar 

  34. Volgenant T., Jonker R.: A Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem Based on the 1-Tree Relaxation. Europian J. Operational Research 9 (1982) 83–89

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, University of Belgrade, Belgrade

    Dragoš Cvetković

  2. Faculty of Organizational Sciences, University of Belgrade, Belgrade

    Mirjana Čangalović & Vera Kovačević-Vujčić

Authors
  1. Dragoš Cvetković
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mirjana Čangalović
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vera Kovačević-Vujčić
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GSIA, Carnegie Mellon University, Schenley Park, Pittsburgh, PA, 15213, USA

    Gérard Cornuéjols

  2. Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010, Graz, Austria

    Rainer E. Burkard  & Gerhard J. Woeginger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cvetković, D., Čangalović, M., Kovačević-Vujčić, V. (1999). Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-48777-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66019-4

  • Online ISBN: 978-3-540-48777-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation