Combinatorial Optimization W Cook, W Cunningham, W Pulleyblank, A Schrijver Wiley, 1997 | 5197* | 1997 |

The traveling salesman problem: a computational study DL Applegate Princeton Univ Pr, 2006 | 3757* | 2006 |

Combinatorial Optimization. Integer and Combinatorial Optimization WJ Cook, WH Cunningham, WR Pulleybank, A Schrijver Wiley Interscience, 1998 | 1876* | 1998 |

A computational study of the job-shop scheduling problem D Applegate, W Cook ORSA Journal on computing 3 (2), 149-156, 1991 | 1362 | 1991 |

In pursuit of the traveling salesman: mathematics at the limits of computation WJ Cook Princeton University Press, 2015 | 650 | 2015 |

Concorde TSP solver D Applegate, R Bixby, V Chvatal, W Cook | 649* | 2006 |

On the solution of traveling salesman problems D Applegate, R Bixby, W Cook, V Chvátal Rheinische Friedrich-Wilhelms-Universität Bonn, 1998 | 592 | 1998 |

Chained Lin-Kernighan for large traveling salesman problems D Applegate, W Cook, A Rohe Informs journal on computing 15 (1), 82-92, 2003 | 516 | 2003 |

Finding cuts in the TSP (A preliminary report) D Applegate, R Bixby, V Chvátal, W Cook Report, 1995 | 376 | 1995 |

Computing minimum-weight perfect matchings W Cook, A Rohe INFORMS journal on computing 11 (2), 138-148, 1999 | 345 | 1999 |

Chvátal closures for mixed integer programming problems W Cook, R Kannan, A Schrijver Mathematical Programming 47 (1-3), 155-174, 1990 | 345 | 1990 |

On the complexity of cutting-plane proofs W Cook, CR Coullard, G Turán Discrete Applied Mathematics 18 (1), 25-38, 1987 | 339 | 1987 |

Sensitivity theorems in integer linear programming W Cook, AMH Gerards, A Schrijver, É Tardos Mathematical Programming 34, 251-264, 1986 | 255 | 1986 |

Tour merging via branch-decomposition W Cook, P Seymour INFORMS Journal on Computing 15 (3), 233-248, 2003 | 238 | 2003 |

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 | 230 | 2009 |

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems D Applegate, R Bixby, V Chvátal, W Cook Mathematical programming 97, 91-153, 2003 | 230 | 2003 |

TSP cuts which do not conform to the template paradigm D Applegate, R Bixby, V Chvátal, W Cook Computational Combinatorial Optimization: Optimal or Provably Near-Optimal …, 2001 | 193 | 2001 |

A parallel cutting-plane algorithm for the vehicle routing problem with time windows W Cook, JL Rich | 189 | 1999 |

Solution of a min-max vehicle routing problem D Applegate, W Cook, S Dash, A Rohe INFORMS Journal on computing 14 (2), 132-143, 2002 | 161 | 2002 |

On cutting-plane proofs in combinatorial optimization V Chvátal, W Cook, M Hartmann Linear algebra and its applications 114, 455-499, 1989 | 157 | 1989 |