Hamiltonian Circuits and the Travelling Salesman Problem

The problem of finding a hamiltonian circuit in a directed graph is discussed and two algorithms are described and compared. Exact methods for the solution of the travelling salesman problem are given with particular emphasis being placed on the calculation of tight bounds that can be used in a variety of tree-search algorithms. Procedures using the assignment and shortest spanning tree problems to provide such bounds and to direct the tree-search are surveyed.

[1]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[2]  John M. Charlton,et al.  A Method of Solution for General Machine-Scheduling Problems , 1970, Oper. Res..

[3]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[4]  O. Ore.  Theory of Graphs , 1962 .

[5]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[6]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[7]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[8]  Nicos Christofides,et al.  The Shortest Hamiltonian Chain of a Graph , 1970 .

[9]  C. Nash-Williams.  On Hamiltonian circuits in finite graphs , 1966 .

[10]  Eugene L. Lawler,et al.  A solvable case of the traveling salesman problem , 1971, Math. Program..

[11]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[12]  Maciej M. Syslo,et al.  A new solvable case of the traveling salesman problem , 1973, Math. Program..

[13]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[14]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[15]  S. M. Roberts,et al.  Systematic generation of Hamiltonian circuits , 1966, CACM.

[16]  Bernard Roy,et al.  Algèbre moderne et théorie des graphes orientées vers les sciences économiques et sociales , 1969 .

[17]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[18]  Nicos Christofides,et al.  Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..

[19]  S. M. Roberts,et al.  An Engineering Approach to the Traveling Salesman Problem , 1966 .

[20]  Geoffrey Richard Selby.  The use of topological methods in computer-aided circuit layout , 1970 .

[21]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[22]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..