Skip to main content
SpringerLink
Log in

The Traveling Salesman Problem

  • Chapter
Combinatorial Optimization

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

  • 1074 Accesses

Abstract

In Chapter 15 we introduced the Traveling Salesman Problem (TSP) and showed that it is NP-hard (Theorem 15.41). The TSP is perhaps the best studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied. We start by discussing approximation algorithms in Sec-tions 21.1 and 21.2. In practice, so-called local search algorithms (discussed in Section 21.3) find better solutions for large instances although they do not have a finite performance ratio.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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

General Literature

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., and Schrijver, A. [1998]: Combinatorial Optimization. Wiley, New York 1998, Chapter 7

    MATH  Google Scholar 

  • Jungnickel, D. [1999]: Graphs, Networks and Algorithms. Springer, Berlin 1999, Chapter 14

    Book  Google Scholar 

  • Lawler, E.L., Lenstra J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. [1985]: The Traveling Salesman Problem. Wiley, Chichester 1985

    MATH  Google Scholar 

  • Jünger, M., Reinelt, G., and Rinaldi, G. [1995]: The traveling salesman problem. In: Handbooks in Operations Research and Management Science; Volume 7; Network Models M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser, eds.), Elsevier, Amsterdam 1995

    Google Scholar 

  • Papadimitriou, C.H., and Steiglitz, K. [1982]: Combinatorial Optimization; Algorithms and Complexity. Prentice-Hall, Englewood Cliffs 1982, Section 17.2, Chapters 18 and 19

    MATH  Google Scholar 

  • Reinelt, G. [1994]: The Traveling Salesman; Computational Solutions for TSP Applications. Springer, Berlin 1994

    Google Scholar 

Cited References

  • Aarts, E., and Lenstra, J.K. [1997]: Local Search in Combinatorial Optimization. Wiley, Chichester 1997

    MATH  Google Scholar 

  • Applegate, D., Bixby, R., Chvátal, V., and Cook, W. [1998]: On the solution of traveling salesman problems. Documenta Mathematica; extra volume ICM 1998; III, 645–656

    Google Scholar 

  • Applegate, D., Cook, W., and Rohe, A. [1999]: Chained Lin-Kernighan for large traveling salesman problems. Report No. 99887, Research Institute for Discrete Mathematics, University of Bonn, 1999

    Google Scholar 

  • Arora, S. [1996]: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (1996), 2-12

    Google Scholar 

  • Arora, S. [1997]: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (1997), 554-563

    Google Scholar 

  • Arora, S. [1998]: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45 (1998), 753–782

    Article  MathSciNet  MATH  Google Scholar 

  • Boyd, S.C, and Cunningham, W.H. [1991]: Small traveling salesman polytopes. Mathematics of Operations Research 16 (1991), 259–271

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard, R.E., Deĭneko, V.G., and Woeginger, G.J. [1998]: The travelling salesman and the PQ-tree. Mathematics of Operations Research 23 (1998), 613–623

    Article  MathSciNet  Google Scholar 

  • Carr, R. [1997]: Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Mathematics of Operations Research 22 (1997), 257–265

    Article  MathSciNet  MATH  Google Scholar 

  • Chalasani, P., Motwani, R., and Rao, A. [1996]: Algorithms for robot grasp and delivery. Proceedings of the 2nd International Workshop on Algorithmic Foundations of Robotics (1996), 347-362

    Google Scholar 

  • Chandra, B., Karloff, H., and Tovey, C. [1999]: New results on the old k-opt algorithm for the traveling salesman problem. SIAM Journal on Computing 28 (1999), 1998–2029

    Article  MathSciNet  MATH  Google Scholar 

  • Christofides, N. [1976]: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh 1976

    Google Scholar 

  • Chvátal, V. [1973]: Edmonds’ polytopes and weakly hamiltonian graphs. Mathematical Programming 5 (1973), 29–40

    Article  MathSciNet  MATH  Google Scholar 

  • Dantzig, G., Fulkerson, R., and Johnson, S. [1954]: Solution of a large-scale traveling-salesman problem. Operations Research 2 (1954), 393–410

    Article  MathSciNet  Google Scholar 

  • Frank, A., Triesch, E., Korte, B., and Vygen, J. [1998]: On the bipartite travelling salesman problem. Report No. 98866, Research Institute for Discrete Mathematics, University of Bonn, 1998

    Google Scholar 

  • Garey, M.R., Graham, R.L., and Johnson, D.S. [1976]: Some NP-complete geometric problems. Proceedings of the 8th Annual ACM Symposium on the Theory of Computing (1976), 10-22

    Google Scholar 

  • Grötschel, M., and Padberg, M.W. [1979]: On the symmetric travelling salesman problem. Mathematical Programming 16 (1979), 265–302

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M., and Pulleyblank, W.R. [1986]: Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research 11 (1986), 537–569

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., and Karp, R.M. [1962]: A dynamic programming approach to sequencing problems. Journal of SIAM 10 (1962), 196–210

    MathSciNet  MATH  Google Scholar 

  • Held M., and Karp, R.M. [1970]: The traveling-salesman problem and minimum spanning trees. Operations Research 18 (1970), 1138–1162

    Article  MathSciNet  MATH  Google Scholar 

  • Held, M., and Karp, R.M. [1971]: The traveling-salesman problem and minimum spanning trees; part II. Mathematical Programming 1 (1971), 6–25

    Article  MathSciNet  MATH  Google Scholar 

  • Johnson, D.S., McGeoch, L.A., and Rothberg, E.E. [1996]: Asymptotic experimental analysis for the Held-Karp traveling salesman bound. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996), 341-350

    Google Scholar 

  • Karp, R.M. [1977]: Probabilistic analysis of partitioning algorithms for the TSP in the plane. Mathematics of Operations Research 2 (1977), 209–224

    Article  MathSciNet  MATH  Google Scholar 

  • Karp, R.M., and Papadimitriou, C.H. [1982]: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11 (1982), 620–632

    Article  MathSciNet  MATH  Google Scholar 

  • Land, A.H., and Doig, A.G. [1960]: An automatic method of solving discrete programming problems. Econometrica 28 (1960), 497–520

    Article  MathSciNet  MATH  Google Scholar 

  • Lin, S., and Kernighan, B.W. [1973]: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21 (1973), 498–516

    Article  MathSciNet  MATH  Google Scholar 

  • Little, J.D.C., Murty, K.G., Sweeny, D.W., and Karel, C. [1963]: An algorithm for the traveling salesman problem. Operations Research 11 (1963), 972–989

    Article  MATH  Google Scholar 

  • Mitchell, J. [1999]: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28 (1999), 1298–1309

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1977]: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), 237–244

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1978]: The adjacency relation on the travelling salesman polytope is NP-complete. Mathematical Programming 14 (1978), 312–324

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H. [1992]: The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing 21 (1992), 450–465

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., and Steiglitz, K. [1977]: On the complexity of local search for the traveling salesman problem. SIAM Journal on Computing 6(1), 1977, 76–83

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., and Steiglitz, K. [1978]: Some examples of difficult traveling salesman problems. Operations Research 26 (1978), 434–443

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., and Vempala, S. [2000]: On the approximability of the traveling salesman problem. Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (2000), 126-133

    Google Scholar 

  • Papadimitriou, C.H., and Yannakakis, M. [1993]: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18 (1993), 1–12

    Article  MathSciNet  MATH  Google Scholar 

  • Rao, S.B., and Smith, W.D. [1998]: Approximating geometric graphs via “spanners” and “banyans”. Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (1998), 540-550

    Google Scholar 

  • Rosenkrantz, D.J. Stearns, R.E., and Lewis, P.M. [1977]: An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6 (1977), 563–581

    Article  MathSciNet  MATH  Google Scholar 

  • Sahni, S., and Gonzalez, T. [1976]: P-complete approximation problems. Journal of the ACM 23 (1976), 555–565

    Article  MathSciNet  MATH  Google Scholar 

  • Shmoys, D.B., and Williamson, D.P. [1990]: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters 35 (1990), 281–285

    Article  MathSciNet  MATH  Google Scholar 

  • Triesch, E., Nolles, W., and Vygen, J. [1994]: Die Einsatzplanung von Zementmischern und ein Traveling Salesman Problem In: Operations Research; Reflexionen aus Theorie und Praxis (B. Werners, R. Gabriel, eds.), Springer, Berlin 1994 [in German]

    Google Scholar 

  • Wolsey, L.A. [1980]: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13 (1980), 121–134

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Korte, B., Vygen, J. (2002). The Traveling Salesman Problem. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21711-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21711-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-21713-9

  • Online ISBN: 978-3-662-21711-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation