The traveling salesman problem: An overview of exact and approximate algorithms

[1]  Claude-Nicolas Fiechter,et al.  A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..

[2]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[3]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

[5]  Matteo Fischetti,et al.  An additive bounding procedure for the asymmetric travelling salesman problem , 1992, Math. Program..

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

[7]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[8]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[9]  Gilbert Laporte,et al.  A Combinatorial Optimization Problem Arising in Dartboard Design , 1991 .

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

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

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

[13]  H. Ong,et al.  Asymptotic expected performance of some TSP heuristics: An empirical evaluation , 1989 .

[14]  Matteo Fischetti,et al.  New lower bounds for the Symmetric Travelling Salesman Problem , 1989, Math. Program..

[15]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[16]  J. Pekny,et al.  Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem , 1989 .

[17]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[18]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

[19]  André Langevin,et al.  CLASSIFICATION OF TRAVELING SALESMAN PROBLEM FORMULATIONS , 1988 .

[20]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[21]  T. Liebling,et al.  Probabilistic exchange algorithms and Euclidean traveling salesman problems , 1986 .

[22]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[23]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, 23rd ACM/IEEE Design Automation Conference.

[24]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[25]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[26]  E. Lawler.  THE TRAVELING SALESMAN PROBLEM : A GUIDED TOUR OF COMBINATORIAL OPTIMIZATION , 1985 .

[27]  Lawrence R. Rabiner,et al.  Combinatorial optimization:Algorithms and complexity , 1984 .

[28]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[29]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[30]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[31]  Christos H. Papadimitriou,et al.  Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..

[32]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

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

[34]  Richard M. Karp,et al.  A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[35]  Robert F. Love,et al.  Heuristic for the Hamiltonian Path Problem in Euclidian Two Space , 1979 .

[36]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[37]  Robert S. Garfinkel,et al.  Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems , 1977, Oper. Res..

[38]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[39]  R. Love,et al.  Geometric Approaches to Solving the Traveling Salesman Problem , 1977 .

[40]  Robert E. Tarjan,et al.  Finding optimum branchings , 1977, Networks.

[41]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[42]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[43]  Jakob Krarup,et al.  Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..

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

[45]  Robert S. Garfinkel,et al.  Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem , 1973, Oper. Res..

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

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

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

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

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

[51]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

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

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

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

[55]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[56]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

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

[58]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[59]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[60]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[61]  F. Glover,et al.  The application of tabu search to the symmetric traveling salesman problem , 1989 .

[62]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

[63]  E. Lawler,et al.  Well-solved special cases , 1985 .

[64]  E. Lawler,et al.  The traveling salesman problem , 1985 .

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

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

[67]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[68]  T. H. C. Smith,et al.  A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation , 1977 .

[69]  Gerald L. Thompson,et al.  Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems. , 1977 .

[70]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[71]  K. G. Murty.  An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .

[72]  Donald M. Shapiro,et al.  Algorithms for the solution of the optimal cost and bottle-neck travelingsalesman problems. , 1966 .

[73]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .