Optimal Hamiltonian Cycles: A Survey of Recent Results
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.
KeywordsSpan Tree Open Vertex Minimum Span Tree Travel Salesman Problem Travel Salesman Problem
Unable to display preview. Download preview PDF.
- M. Bellmore and G.L. Nemhauser, “The traveling salesman problem: a survey’ Oper. Res. 16, N°3 (1968) 538–558.Google Scholar
- A.M. Isaac and E. Turban, ’’’Some comments on the traveling salesman problem’, Oper. Res. 17, N°3 (1969) 543–546.Google Scholar
- M. Held and R.M. Karp, ‘The traveling salesman problem and minimum spanning trees’’, Oper. Res. 18 (1970).Google Scholar
- N. Chirstofides, ‘The shortest Hamiltonian Chain of a Graph’, SIAM J. Appl. Math. 19, N° 4 (1970) 689–696.Google Scholar
- A.G. Azpeitia and D. Riley, “ The longest path in a network”, J. Math. An. and Appl. 30 (1970) 636638.Google Scholar
- 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
- 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
- P.M. Camerini, L. Fratta, F. Maffioli, “A Heuristically guided Algorithm for the Travelling Salesman Problem”, (to be published).Google Scholar
- 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
- E.L. Lawler, “The complexity of combinatorial computa tions: a survey”, Proc. 1971 Polytechnic Institute of Brooklyn Symp. on Computers and Automata.Google Scholar
- 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
- Comm. of ACM vol. 15, N° 4 (1972) 273–274.Google Scholar