Skip to main content
SpringerLink
Log in

A note on heuristics for the traveling salesman problem

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

We introduce subclasses of the traveling salesman problem (TSP) and analyze the behaviour of heuristics on them. We derive bounds for the performance of the algorithms.

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

References

  1. D.J. Rosenkrants, R.E. Stearns and P.M. Lewis II, “An analysis of several heuristics for the traveling salesman problem”,SIAM Journal of Computing 6 (1977) 563–581.

    Google Scholar 

  2. N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem”, GSIA, Carnegie-Mellon University (February, 1976).

  3. G. Cornuejols and G.L. Nemhauser, “Tight bounds for Christofides traveling salesman heuristic”,Mathematical Programming 14 (1978) 116–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departimento di Matematica, Università di Calabria, Cosenza, Italy

    Gianfranco d'Atri

Authors
  1. Gianfranco d'Atri
    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

d'Atri, G. A note on heuristics for the traveling salesman problem. Mathematical Programming 19, 111–114 (1980). https://doi.org/10.1007/BF01581633

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation