The Traveling Salesman Problem: A Computational Study
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer Science
- 4 February 2007
Open Library features a library with books from the Internet Archive and lists them in the open library and gives you access to over 1 million free e-Books and the ability to search using subject, title and author.
A Computational Study of the Job-Shop Scheduling Problem
- D. Applegate, W. Cook
- BusinessINFORMS journal on computing
- 1 May 1991
The optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10×10 problem of J. F. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1.
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Education
- 15 January 2007
The authors are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem, and here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms.
On the Solution of Traveling Salesman Problems
- D. Applegate, R. Bixby, W. Cook
- History
- 1998
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulk- erson, and S.M. Johnson demonstrated in 1954 that large instances of the…
Chained Lin-Kernighan for Large Traveling Salesman Problems
- D. Applegate, W. Cook, André Rohe
- Computer ScienceINFORMS journal on computing
- 15 January 2003
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are…
Sampling and integration of near log-concave functions
- D. Applegate, R. Kannan
- Computer ScienceSymposium on the Theory of Computing
- 3 January 1991
This work provides the first polynomial time algorithm to generate samples from a given log-concave distribution and proves a general isoperimetric inequality for convex sets and uses this together with recent developments in the theory of rapidly mixing Markov chains.
TSP Cuts Which Do Not Conform to the Template Paradigm
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer ScienceComputational Combinatorial Optimization
- 15 May 2000
The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates.
Exact solutions to linear programming problems
- D. Applegate, W. Cook, S. Dash, Daniel G. Espinoza
- Computer ScienceOperations Research Letters
- 1 November 2007
Finding Cuts in the TSP (A preliminary report)
- D. Applegate, R. Bixby, V. Chvátal, B. Cook
- History
- 10 April 1995
TSPLIB is Gerhard Reinelt''s library of some hundred instances of the traveling salesman problem. Some of these instances arise from drilling holes in printed circuit boards; others arise from X-ray…
Solution of a Min-Max Vehicle Routing Problem
- D. Applegate, W. Cook, S. Dash, André Rohe
- Computer ScienceINFORMS journal on computing
- 15 April 2002
This algorithmic framework combines the LP-based traveling salesman code of Applegate, Bixby, ChvAital, and Cook, with specialized cutting planes and a distributed search algorithm, permitting the use of a computing network located across Rice, Princeton, AT&T, and Bonn.
...
...