• Publications
  • Influence
The Traveling Salesman Problem: A Computational Study
As the name suggests, Open Library features a library with books from the Internet Archive and lists them in the open library. Expand
  • 1,268
  • 126
Combinatorial optimization
  • 2,355
  • 72
A Computational Study of the Job-Shop Scheduling Problem
The job-shop scheduling problem is a notoriously difficult problem in combinatorial optimization. Expand
  • 832
  • 68
Solution of a Large-Scale Traveling-Salesman Problem
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled” [6]: Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner. Expand
  • 796
  • 40
  • PDF
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem, a problem that has inspired studies by mathematicians, chemists, and physicists. Expand
  • 494
  • 39
Chvátal closures for mixed integer programming problems
We show that for a given polyhedronP and integral vectorw, the set of vectors that satisfy every cutting plane forP with respect to a specified subset of integer variables is again apolyhedron, analogous to the process of repeatedly taking Chvátal closures in integer programming. Expand
  • 265
  • 37
  • PDF
On the Solution of Traveling Salesman Problems
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 theExpand
  • 323
  • 29
  • PDF
Tour Merging via Branch-Decomposition
We describe a heuristic method for finding branch decompositions; the method is based on the eigenvector technique for finding graph separators. Expand
  • 185
  • 26
SIAM Journal on Optimization
The SIAM Journal on Optimization contains research articles on the theory and practice of optimization. Expand
  • 138
  • 25
TSP Cuts Which Do Not Conform to the Template Paradigm
The first computer implementation of the Dantzig-Fulkerson-Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory's type. Expand
  • 131
  • 23
  • PDF