Chapter 4 The traveling salesman problem

This publication has 93 references indexed in Scilit:

• An efficient algorith for determining the convex hull of a finite planar set
  Published by Elsevier ,2002
• A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
  Algorithmica, 1992
• Quick updates for p-opt TSP heuristics
  Operations Research Letters, 1992
• A complete description of the traveling salesman polytope on 8 nodes
  Operations Research Letters, 1991
• Analyzing the Held-Karp tsp bound: a monotonicity property with application
  Information Processing Letters, 1990
• Searching for optimal configurations by simulated tunneling
  Zeitschrift für Physik B Condensed Matter, 1988
• An improved solution to the traveling salesman problem with thousands of nodes
  Communications of the ACM, 1984
• Optimization by Simulated Annealing
  Science, 1983
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1908