Skip to main content

The traveling-salesman problem and minimum spanning trees: Part II

Abstract

The relationship between the symmetric traveling-salesman problem and the minimum spanning tree problem yields a sharp lower bound on the cost of an optimum tour. An efficient iterative method for approximating this bound closely from below is presented. A branch-and-bound procedure based upon these considerations has easily produced proven optimum solutions to all traveling-salesman problems presented to it, ranging in size up to sixty-four cities. The bounds used are so sharp that the search trees are minuscule compared to those normally encountered in combinatorial problems of this type.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    S. Agmon, “The relaxation method for linear inequalities,”Canadian Journal of Mathematics 6 (1954) 382–392.

    Google Scholar 

  2. [2]

    M. Bellmore and G.L. Nemhauser, “The traveling salesman problem: a survey”,Operations Research 16 (1968) 538–558.

    Google Scholar 

  3. [3]

    G.A. Croes, “A method for solving traveling salesman problems,”Operations Research 6 (1958) 791–812.

    Google Scholar 

  4. [4]

    G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large scale traveling salesman problem”,Operation Research 2 (1954) 393–410.

    Google Scholar 

  5. [5]

    E.W. Dijkstra, “A note on two problems in connexion with graphs,”Numerische Mathematik 1 (1959) 269–271.

    Google Scholar 

  6. [6]

    D. Gale, “Optimal assignments in an ordered set: an application of matroid theory,”Journal of Combinatorial Theory 4 (1968) 176–180.

    Google Scholar 

  7. [7]

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

    Google Scholar 

  8. [8]

    M. Held and R.M. Karp, “A dynamic programming approach to sequencing problems,”Journal of the Society for Industrial and Applied Mathematics 10 (1962) 196–210.

    Google Scholar 

  9. [9]

    L.L. Karg and G.L. Thompson, “A heuristic approach to solving traveling salesman problems,”Management Science 10 (1964) 225–248.

    Google Scholar 

  10. [10]

    J.B. Kruskal, “On the shortest spanning subtree of a graph and the traveling salesman problem,”Proceedings of the American Mathematical Society 2 (1956) 48–50.

    Google Scholar 

  11. [11]

    S. Lin, “Computer solution of the traveling salesman problem,”Bell System Technical Journal 44 (1965) 2245–2269.

    Google Scholar 

  12. [12]

    T. Motzkin and I.J. Schoenberg, “The relaxation method for linear inequalities,”Canadian Journal of Mathematics 6 (1954) 393–404.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

This research has been partially supported by the National Science Foundation under Grant GP-25081 with the University of California. Reproduction in whole or in part is permitted for any purpose of the United States Government.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Held, M., Karp, R.M. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, 6–25 (1971). https://doi.org/10.1007/BF01584070

Download citation

Keywords

  • Mathematical Method
  • Iterative Method
  • Span Tree
  • Search Tree
  • Minimum Span Tree