Estimating the Held-Karp lower bound for the geometric TSP

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

[2]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

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

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

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

[6]  J. Scherpenisse,et al.  A pseudo random number generator , 1974 .

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

[8]  ACM president's letter , 1975 .

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

[10]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[11]  David M Stein.  SCHEDULING DIAL-A-RIDE TRANSPORTATION SYSTEMS: AN ASYMPTOTIC APPROACH , 1977 .

[12]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[13]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[14]  J. Michael Steele,et al.  Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..

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

[16]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

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

[19]  David P. Williamson,et al.  Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

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

[21]  Michel X. Goemans,et al.  Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem , 1991, Math. Oper. Res..

[22]  Antonia J. Jones,et al.  Evolutionary Divide and Conquer (I): A Novel Genetic Approach to the TSP , 1993, Evolutionary Computation.

[23]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[24]  C. L. Valenzuela,et al.  A parallel implementation of evolutionary divide and conquer for the TSP , 1995 .

[25]  David Applegate,et al.  Finding Cuts in the TSP (A preliminary report) , 1995 .

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

[27]  William J. Cook,et al.  Combinatorial optimization , 1997 .