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

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

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

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… Expand

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