Optimal Hamiltonian Cycles: A Survey of Recent Results

  • Francesco Maffioli
Part of the International Centre for Mechanical Sciences book series (CISM, volume 135)


The problem of finding a shortest elementary (*) cycle spanning all the nodes of a given arc weighted graph is called traveling salesman problem (TSP) and any solution is called a shortest hamiltonian cycle (SH) or a shortest tour of the given graph.


Span Tree Open Vertex Minimum Span Tree Travel Salesman Problem Travel Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Bellmore and G.L. Nemhauser, “The traveling salesman problem: a survey’ Oper. Res. 16, N°3 (1968) 538–558.Google Scholar
  2. [2]
    A.M. Isaac and E. Turban, ’’’Some comments on the traveling salesman problem’, Oper. Res. 17, N°3 (1969) 543–546.Google Scholar
  3. [3]
    P.C. Gilmore and R.E. Gomory, “Sequencing a one-state variable machine: a solvable case of the travel ing salesman problem’ Oper. Res. 12 (1964) 655–679.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    E.L. Lawler, “A solvable case of the traveling salesman problem” Math. Progr. 1, N° 2 (1971) 267–269.MathSciNetCrossRefGoogle Scholar
  5. [5]
    M. Held and R.M. Karp, ‘The traveling salesman problem and minimum spanning trees’’, Oper. Res. 18 (1970).Google Scholar
  6. [6]
    M. Held and R.M. Karp, “The traveling salesman problem and minimum spanning tree: part II, Math. Progr. 1 (1971), 6–25.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    P. Krolak and W. Felts, “A man-machine approach toward solving the traveling salesman problem” Comm. ACM 14, N° 5 (1971) 327–334.CrossRefGoogle Scholar
  8. [8]
    N. Chirstofides, ‘The shortest Hamiltonian Chain of a Graph’, SIAM J. Appl. Math. 19, N° 4 (1970) 689–696.Google Scholar
  9. [9]
    A.G. Azpeitia and D. Riley, “ The longest path in a network”, J. Math. An. and Appl. 30 (1970) 636638.Google Scholar
  10. [10]
    P.E. Hart, N.L. Nillson and B. Raphael, “ A formal basis for the heuristic determination of minimum cost paths” IEEE Trans. on SSC,SSC-4 N° 2 (1968) 100–107.Google Scholar
  11. [11]
    L. Fratta and F. Maffioli, “ On the shortest Hamiltonian chain of a network’, 2nd International Symp. on Network Theory, Herceg-Novi (YU) July 1972.Google Scholar
  12. [12]
    P.M. Camerini, L. Fratta, F. Maffioli, “A Heuristically guided Algorithm for the Travelling Salesman Problem”, (to be published).Google Scholar
  13. [13]
    K. Steiglits and P. Weiner, “ Some improved algorithms for computer solution of the traveling sales man problem” Proc. 6th Allerton Conference on Circuits and System Theory (1968) 814–821.Google Scholar
  14. [14]
    E.L. Lawler, “The complexity of combinatorial computa tions: a survey”, Proc. 1971 Polytechnic Institute of Brooklyn Symp. on Computers and Automata.Google Scholar
  15. [15]
    N. Deo and S.L. Hakimi, “ The shortest generalized Hamiltonian tree” Proc. 3rd Allerton Conference on Circuits and System Theory (1965), 879–883.Google Scholar
  16. [16]
    Comm. of ACM vol. 15, N° 4 (1972) 273–274.Google Scholar
  17. [17]
    G.B. Dantzig, “Linear Programming and Extensions”, Princeton U. Press 1963, 361–366.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1972

Authors and Affiliations

  • Francesco Maffioli
    • 1
  1. 1.Istituto di Elettrotecnica ed ElettronicaPolitecnico di MilanoMilanoItaly

Personalised recommendations