Experimental Analysis of Heuristics for the Stsp

[1]  On the Space lling Curve Heuristic for the Euclidean Traveling Salesman Problem , 1910 .

[2]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[3]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

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

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

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

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

[9]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

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

[11]  G. L. Nemhauser,et al.  Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

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

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

[14]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

[15]  Hoon Liong Ong,et al.  Worst-case analysis of two travelling salesman heuristics , 1984 .

[16]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[17]  John D. Litke,et al.  An improved solution to the traveling salesman problem with thousands of nodes , 1984, CACM.

[18]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[19]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

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

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

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

[23]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

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

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

[26]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[27]  Edward W. Felten,et al.  Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[28]  Susumu Morito,et al.  SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES , 1991 .

[29]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

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

[31]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[32]  Cor A. J. Hurkens.  Nasty TSP Instances for Farthest Insertion , 1992, IPCO.

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

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

[35]  David S. Johnson,et al.  Data structures for traveling salesmen , 1993, SODA '93.

[36]  Yossi Azar.  Lower Bounds for Insertion Methods for TSP , 1994, Comb. Probab. Comput..

[37]  Fred W. Glover,et al.  Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move , 1996, J. Heuristics.

[38]  A. Volgenant,et al.  The travelling salesman, computational solutions for TSP applications , 1996 .

[39]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[40]  Giovanni Manzini,et al.  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..

[41]  Martin Zachariasen,et al.  Tabu Search on the Geometric Traveling Salesman Problem , 1996 .

[42]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[43]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[44]  David S. Johnson,et al.  Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.

[45]  Andrew B. Kahng,et al.  Improved Large-Step Markov Chain Variants for the Symmetric TSP , 1997, J. Heuristics.

[46]  César Rego,et al.  Relaxed tours and path ejections for the traveling salesman problem , 1998, Eur. J. Oper. Res..

[47]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[48]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[49]  William J. Cook,et al.  Finding Tours in the TSP , 1999 .

[50]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[51]  Fred W. Glover,et al.  Construction Heuristics and Domination Analysis for the Asymmetric TSP , 1999, WAE.

[52]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[53]  Weixiong Zhang,et al.  Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.

[54]  David A. Bader,et al.  A New Implmentation and Detailed Study of Breakpoint Analysis , 2000, Pacific Symposium on Biocomputing.

[55]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

[56]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[57]  Egon Balas,et al.  Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study , 2000, INFORMS J. Comput..

[58]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[59]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.