## On the Solution of Traveling Salesman Problems (1998)

by
David Applegate
,
Robert Bixby
,
Vasek Chvátal
,
William Cook

Venue: | DOC. MATH. J. DMV |

Citations: | 163 - 7 self |

### BibTeX

@MISC{Applegate98onthe,

author = {David Applegate and Robert Bixby and Vasek Chvátal and William Cook},

title = { On the Solution of Traveling Salesman Problems},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel , S. Hong , M. Jünger , P. Miliotis , D. Naddef , M. Padberg