Skip to main content
SpringerLink
Log in

Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970 and published in Mathematical Programming in 1971. Its outstanding performance is due to a clever exploitation of the relationship between the traveling-salesman problem and minimum spanning trees.

However, various improvements of their method have led to a version (IHK) which tends to be some 25 times faster than the original one. Experiments with data selected at random, ranging in size up to 80 cities, show that the computing time for IHK is roughly doubled as the number of cities is increased by 10.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. M.H. van Emden, “Increasing the efficiency of quicksort”, Algorithm 402,Communications of the Association for Computing Machinery 13 (1970) 693–695.

    Google Scholar 

  3. K. Helbig Hansen, “Sekvensproblemer med vaegt på modifikation af Held og Karp's algoritme”, M.Sc. thesis, Institute of Datalogy, University of Copenhagen, Denmark (1971).

    Google Scholar 

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

    Google Scholar 

  5. M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees: Part II”,Mathematical Programming 1 (1971) 6–25.

    Google Scholar 

  6. 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 

  7. R.C. Prim, “Shortest connection networks and some generalizations”,Bell System Technical Journal 36 (1957) 1389–1401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Spadille, Inc., and Institute of Datalogy, University of Copenhagen, Denmark

    Keld Helbig Hansen & Jakob Krarup

Authors
  1. Keld Helbig Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakob Krarup
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Helbig Hansen, K., Krarup, J. Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem. Mathematical Programming 7, 87–96 (1974). https://doi.org/10.1007/BF01585505

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585505

Keywords

Search

Navigation