| The traveling salesman problem: a computational study DL Applegate Princeton Univ Pr, 2006 | 2994 | 2006 |
| Combinatorial Optimization W Cook, W Cunningham, W Pulleyblank, A Schrijver Wiley, 1997 | 1614* | 1997 |
| Combinatorial Optimization. Integer and Combinatorial Optimization WJ Cook, WH Cunningham, WR Pulleybank, A Schrijver Wiley Interscience, 1998 | 1597* | 1998 |
| A computational study of the job-shop scheduling problem D Applegate, W Cook ORSA Journal on computing 3 (2), 149-156, 1991 | 1145 | 1991 |
| On the solution of traveling salesman problems D Applegate, R Bixby, W Cook, V Chvátal Rheinische Friedrich-Wilhelms-Universität Bonn, 1998 | 533 | 1998 |
| Concorde TSP solver D Applegate, R Bixby, V Chvatal, W Cook | 514* | 2006 |
| In pursuit of the traveling salesman: mathematics at the limits of computation WJ Cook Princeton University Press, 2011 | 479 | 2011 |
| Chained Lin-Kernighan for large traveling salesman problems D Applegate, W Cook, A Rohe INFORMS Journal on Computing 15 (1), 82-92, 2003 | 445 | 2003 |
| 50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ... Springer Science & Business Media, 2009 | 388 | 2009 |
| Finding cuts in the TSP (A preliminary report) D Applegate, R Bixby, V Chvátal, W Cook Report 95 (05), 1995 | 328 | 1995 |
| Chvátal closures for mixed integer programming problems W Cook, R Kannan, A Schrijver Mathematical Programming 47 (1-3), 155-174, 1990 | 314 | 1990 |
| Computing minimum-weight perfect matchings W Cook, A Rohe INFORMS journal on computing 11 (2), 138-148, 1999 | 302 | 1999 |
| On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987 | 266 | 1987 |
| Tour merging via branch-decomposition W Cook, P Seymour INFORMS Journal on Computing 15 (3), 233-248, 2003 | 213 | 2003 |
| Sensitivity theorems in integer linear programming W Cook, AMH Gerards, A Schrijver, É Tardos Mathematical Programming 34 (3), 251-264, 1986 | 207 | 1986 |
| Age and family burden among parents of offspring with severe mental illness JA Cook, HP Lefley, SA Pickett, BJ Cohler American journal of orthopsychiatry 64 (3), 435-447, 1994 | 190 | 1994 |
| Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems D Applegate, R Bixby, V Chvátal, W Cook Mathematical programming 97 (1-2), 91-153, 2003 | 187 | 2003 |
| A parallel cutting-plane algorithm for the vehicle routing problem with time windows W Cook, JL Rich | 180 | 1999 |
| TSP cuts which do not conform to the template paradigm D Applegate, R Bixby, V Chvátal, W Cook Computational combinatorial optimization, 261-303, 2001 | 172 | 2001 |
| Certification of an optimal TSP tour through 85,900 cities DL Applegate, RE Bixby, V Chvátal, W Cook, DG Espinoza, M Goycoolea, ... Operations Research Letters 37 (1), 11-15, 2009 | 159 | 2009 |
David ApplegateLead Member of Technical Staff, AT&T Labs -- ResearchVerified email at research.att.com
