Skip to main content
SpringerLink
Log in

Traveling salesman problem

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Operations Research and Management Science

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 532.00
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

References

  1. Aarts, E.H.L., Korst, J.H.M., and Laarhoven, P.J.M. (1988). “A Quantitative Analysis of the Simulated Annealing Algorithm: A Case Study for the Traveling Salesman Problem,” Jl. Stats. Phys. 50, 189–206

    Google Scholar 

  2. Applegate, D., Bixby, R.E., Chvatal, V., and Cook, W. (1998). “atOn the solution of traveling salesman problems,” Documenta Mathematica–Extra Volume ICM 1998– III, 645–658.

    Google Scholar 

  3. Applegate, D., Bixby, R.E., Chvatal, V., and Cook, W. (1994). “Finding cuts in the TSP,” preliminary report distributed at The Mathematical Programming Symposium, Ann Arbor, Michigan, August 1994.

    Google Scholar 

  4. Balas, E. (1989). “The Prize Collecting Traveling Salesman Problem,” Networks 19, 621–636.

    Google Scholar 

  5. Bland, R.E. and Shallcross, D.F. (1987). “Large Traveling Salesman Problem Arising from Experiments in X-ray Crystallography: a Preliminary Report on Computation,” Technical Report No. 730, School of OR/ IE, Cornell University, Ithaca, New York.

    Google Scholar 

  6. Burkard, R.E., Deineko, V.G., van Dal, R., van der Veen, J.A.A., and Woeginger, G.J. (1998). “Well-Solvable Cases of the Traveling Salesman Problem: A Survey,” SIAM Review 40, 496–546.

    Google Scholar 

  7. Christof, T. and Reinelt, G. (1995). “Parallel cutting plane generation for the TSP in Parallel Programming and Applications (P. Fritzson, L. Finmo, eds.) IOS Press, 163–169.

    Google Scholar 

  8. Christofides, N. (1985). “Vehicle Routing,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 431–448.

    Google Scholar 

  9. Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M. (1954). “Solution of a Large-scale Traveling Salesman Problem,” Operations Research 2, 393–410.

    Google Scholar 

  10. Fiechter, C.N. (1990). “A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems,” Working Paper 90/1, Department of Mathematics, Ecole Polytechnique Federale de Lausanne, Switzerland.

    Google Scholar 

  11. Fisher, M.L. (1988). “Lagrangian Optimization Algorithms for Vehicle Routing Problems,” Operational Research '87, G.K. Rand, ed., 635–649.

    Google Scholar 

  12. Golden, B.L., Levy, L., and Vohra, R. (1987). “The Orienteering Problem,” Naval Research Logistics 34, 307–318.

    Google Scholar 

  13. Golden, B.L. and Stewart, W.R. (1985). “Empirical Analysis of Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 207–250.

    Google Scholar 

  14. Grötschel, M. and Holland, O. (1991). “Solution of Large Scale Symmetric Traveling Salesman Problems,” Mathematical Programming 51, 141–202.

    Google Scholar 

  15. Grötschel, M., Monma, C., and Stoer, M. (1991). “Polyhedral Approaches to Network Survivability,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 5, Amer. Math. Soc., 121–141.

    Google Scholar 

  16. Grötschel, M. and Padberg, M.W. (1985). “Polyhedral Theory,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 251–306.

    Google Scholar 

  17. Grötschel, M. and Padberg, M. (1993). “Ulysses 2000: In Search of Optimal Solutions to Hard Combinatorial Problems,” Technical Report, New York University Stern School of Business.

    Google Scholar 

  18. Hoffman, A.J. and Wolfe, P. (1985). “History” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 1–16.

    Google Scholar 

  19. Johnson, D.S. and Papadimitriou, C.H. (1985). “Performance Guarantees for Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys, eds., John Wiley, 145–180.

    Google Scholar 

  20. Johnson, D.S. (1990). “Local Optimization and the Traveling Salesman Problem,” Proc. 17th Colloquium on Automata, Languages and Programming, Springer Verlag, 446–461.

    Google Scholar 

  21. Jünger, M., Reinelt, G., and Rinaldi, G. (1994). “The Traveling Salesman Problem,” in M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., Handbook on Operations Research and the Management Sciences, North Holland, 225–330.

    Google Scholar 

  22. Karp, R. and Steele, J.M. (1985). “Probabilistic Analysis of Heuristics,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., John Wiley, 181–205.

    Google Scholar 

  23. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., eds. (1985). The Traveling Salesman Problem, John Wiley, Chichester, UK.

    Google Scholar 

  24. Miller, D. and Pekny, J. (1991). “Exact Solution of Large Asymmetric Traveling Salesman Problems,” Science 251, 754–761.

    Google Scholar 

  25. Padberg, M.W. and Grötschel, M. (1985). “Polyhedral Computations,” in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan and D.B. Shmoys, eds., John Wiley, 307–360.

    Google Scholar 

  26. Padberg, M.W. and Rinaldi, G. (1991). “A Branch and Cut Algorithm for the Resolution of Large-scale Symmetric Traveling Salesmen Problems,” SIAM Review 33, 60–100.

    Google Scholar 

  27. Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications Springer-Verlag, Berlin.

    Google Scholar 

  28. Potvin, J.V. (1993). “The Traveling Salesman Problem: A Neural Network Perspective,” INFORMS Jl. Computing 5, 328–348.

    Google Scholar 

  29. Potvin, J.V. (1996). “Genetic Algorithms for the Traveling Salesman Problem,” Annals of Operations Research 63, 339–370.

    Google Scholar 

  30. Ratliff, H.D. and Rosenthal, A.S. (1981). “Order-Picking in a Rectangular Warehouse: A Solvable Case for the Traveling Salesman Problem,” PDRC Report Series No. 81-10. Georgia Institute of Technology, Atlanta, Georgia.

    Google Scholar 

  31. Reinelt, G. (1991). “TSPLIB–A traveling salesman library,” ORSA Jl. Computing 3, 376–384.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. George Mason University, Fairfax, Virginia, USA

    Karla L. Hoffman

  2. New York University, New York, USA

    Manfred Padberg

Authors
  1. Karla L. Hoffman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Robert H. Smith School of Business, University of Maryland, College Part, Maryland, USA

    Saul I. Gass

  2. School of Information Technology & Engineering, George Mason University, Fairfax, Virginia, USA

    Carl M. Harris

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Hoffman, K.L., Padberg, M. (2001). Traveling salesman problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_1068

Download citation

  • DOI: https://doi.org/10.1007/1-4020-0611-X_1068

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-7923-7827-3

  • Online ISBN: 978-1-4020-0611-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation