Aspects of the Traveling Salesman Problem

For fifty years the traveling salesman problem has fascinated mathematicians, computer scientists, and laymen. It is easily stated, but hard to solve; it has become the prototypical hard problem in theoretical computer science. A large part of the extensive research conducted by IBM in the broad area of optimization, or mathematical programming, contributed to or was inspired by aspects of this challenging problem. This article reviews some of that work as well as recent developments in techniques that were used on the largest traveling salesman problem ever solved.

[1]  R. Gomory.  Some polyhedra related to combinatorial problems , 1969 .

[2]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[3]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[4]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[5]  D. R. Fulkerson,et al.  On balanced matrices , 1974 .

[6]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[7]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[8]  Ellis L. Johnson,et al.  Some continuous functions related to corner polyhedra , 1972, Math. Program..

[9]  Monique Guignard-Spielberg,et al.  A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..

[10]  M. Guignard,et al.  Reduction Methods for State Enumeration Integer Programming , 1977 .

[11]  Alan J. Hoffman,et al.  On partitions of a partially ordered set , 1977, J. Comb. Theory, Ser. B.

[12]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[13]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

[14]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[15]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[16]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[17]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[18]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[19]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[20]  Ellis L. Johnson.  Subadditive Lifting Methods for Partitioning and Knapsack Problems , 1980, J. Algorithms.

[21]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[22]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[23]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[24]  A. Hoffman.  Total unimodularity and combinatorial theorems , 1976 .

[25]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[26]  Alan J. Hoffman,et al.  A generalization of max flow—min cut , 1974, Math. Program..

[27]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[28]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[29]  Claude Berge,et al.  Coloring the Edges of A Hypergraph and Linear Programming Techniques , 1977 .

[30]  Ellis L. Johnson.  On the group problem for mixed integer programming , 1974 .

[31]  Kenneth J. Winston,et al.  An Inequality on Binomial Coefficients , 1978 .

[32]  Claude-Alain Burdet,et al.  A Subadditive Approach to Solve Linear Integer Programs , 1977 .

[33]  K. Spielberg.  Plant Location with Generalized Search Origin , 1969 .

[34]  A. J. Hoffman.  The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems , 1979 .

[35]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[36]  M. Padberg,et al.  On the symmetric travelling salesman problem II , 1979 .

[37]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[38]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[39]  R E Gomory,et al.  ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[40]  A. J. Hoffman,et al.  Local Unimodularity in the Matching Polytope , 1978 .

[41]  R E Gomory,et al.  Faces of an integer polyhedron. , 1967, Proceedings of the National Academy of Sciences of the United States of America.

[42]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[43]  H. Crowder,et al.  Use of Cyclic Group Methods in Branch and Bound , 1973 .