Provably good solutions for the traveling salesman problem

The determination of true optimum solutions of combinatorial optimization problems is seldomly required in practical applications. The majority of users of optimization software would be satisfied with solutions of guaranteed quality in the sense that it can be proven that the given solution is at most a few percent off an optimum solution. This paper presents a general framework for practical problem solving with emphasis on this aspect. A detailed discussion along with a report about extensive computational experiments is given for the traveling salesman problem.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[3]  Giovanni Rinaldi,et al.  Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[4]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[5]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

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

[7]  Ulrich Derigs,et al.  Solving (large scale) matching problems combinatorially , 1991, Math. Program..

[8]  Michael Jünger,et al.  A complete description of the traveling salesman polytope on 8 nodes , 1991, Oper. Res. Lett..

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

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

[11]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[12]  William R. Pulleyblank,et al.  Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[13]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[14]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[15]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[16]  E. Balas,et al.  Branch and Bound Methods for the Traveling Salesman Problem , 1983 .

[17]  Gerhard Reinelt,et al.  The Traveling Salesman , 2001, Lecture Notes in Computer Science.

[18]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[19]  R. Jonker,et al.  A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[20]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[21]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[22]  G. Rinaldi,et al.  Chapter 4 The traveling salesman problem , 1995 .

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

[24]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[25]  Gerhard Reinelt,et al.  Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[26]  Ralph E. Gomory,et al.  Solving linear programming problems in integers , 1960 .

[27]  Michael Jünger,et al.  Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut , 1993 .

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

[29]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[30]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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

[32]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[33]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[34]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..