Skip to main content
SpringerLink
Log in

The traveling salesman problem in graphs with some excluded minors

  • Published:
Mathematical Programming Submit manuscript

Abstract

Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of finding a family of edges (an edge may be chosen several times) which forms a spanning Eulerian subgraph of minimum length. In this paper we characterize those graphs for which the convex hull of all solutions is given by the nonnegativity constraints and the classical cut constraints. This characterization is given in terms of excluded minors. A constructive characterization is also given which uses a small number of basic graphs.

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. J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (MacMillan, London, 1976).

    Google Scholar 

  2. G. Cornuejols, J. Fonlupt and D. Naddef, “The Traveling Salesman Problem on a graph and some related integer polyhedra,”Mathematical Programming 33 (1985) 1–27.

    Google Scholar 

  3. G. Cornuejols, D. Naddef and W. Pulleyblank, “The Traveling Salesman Problem on Graphs with 3-edge cutsets,”Journal of the A.C.M. 32 (1985) 383–410.

    Google Scholar 

  4. H. Crowder and M. Padberg, “Solving large scale symmetric Traveling Salesman Problem to optimality,”Management Science 26 (1980) 485–509.

    Google Scholar 

  5. G.A. Dirac, “Some results concerning the structure of graphs,”Canadian Mathematics Bulletin 6 (1963) 183–210.

    Google Scholar 

  6. J. Edmonds and R. Giles, “Total dual integrality of linear inequality system,” in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984).

    Google Scholar 

  7. A. Elnacheff and J. Fonlupt, “Un algorithme polynomial pour le problème du voyageur de commerce sur une classe de graphes,” RT6, ARTEMIS-IMAG Université Scientifique, Technologique et Médicale de Grenoble (Grenoble, 1986).

    Google Scholar 

  8. J. Fonlupt and A. Nachef, “Dynamic programming and the graphical traveling salesman problem,” to appear in:Journal of the A.C.M.

  9. M. Grötschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.

    Google Scholar 

  10. W.R. Pulleyblank, “Polyhedral combinatorics,” in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer, Berlin, 1983).

    Google Scholar 

  11. D. Ratliff and A. Rosenthal, “Order-picking in a rectangular warehouse: a solvable case of the Traveling Salesman Problem,”Operations Research 31 (1983) 507–521.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université J. Fourier, IMAG-Artemis, 38041, Grenoble, France

    Jean Fonlupt & Denis Naddef

Authors
  1. Jean Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Naddef
    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

Fonlupt, J., Naddef, D. The traveling salesman problem in graphs with some excluded minors. Mathematical Programming 53, 147–172 (1992). https://doi.org/10.1007/BF01585700

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation