| 2009 |
| 15 | EE | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William Cook,
Daniel Espinoza,
Marcos Goycoolea,
Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett. 37(1): 11-15 (2009) |
| 2008 |
| 14 | EE | William Cook,
Jayadev Misra:
Structured Interacting Computations.
Software-Intensive Systems and New Computing Paradigms 2008: 139-145 |
| 2007 |
| 13 | EE | Alejandro A. Schäffer,
Edward Stallknecht Rice,
William Cook,
Richa Agarwala:
rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control.
Bioinformatics 23(9): 1156-1158 (2007) |
| 12 | EE | David Applegate,
William Cook,
Sanjeeb Dash,
Daniel Espinoza:
Exact solutions to linear programming problems.
Oper. Res. Lett. 35(6): 693-699 (2007) |
| 2005 |
| 11 | EE | William Cook,
Daniel Espinoza,
Marcos Goycoolea:
A Study of Domino-Parity and k-Parity Constraints for the TSP.
IPCO 2005: 452-467 |
| 2003 |
| 10 | EE | David Applegate,
William Cook,
André Rohe:
Chained Lin-Kernighan for Large Traveling Salesman Problems.
INFORMS Journal on Computing 15(1): 82-92 (2003) |
| 9 | EE | William Cook,
Paul D. Seymour:
Tour Merging via Branch-Decomposition.
INFORMS Journal on Computing 15(3): 233-248 (2003) |
| 2002 |
| 8 | | William Cook,
Andreas S. Schulz:
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings
Springer 2002 |
| 7 | EE | William Cook:
Solving Traveling Salesman Problems.
ESA 2002: 1 |
| 6 | EE | David Applegate,
William Cook,
Sanjeeb Dash,
André Rohe:
Solution of a Min-Max Vehicle Routing Problem.
INFORMS Journal on Computing 14(2): 132-143 (2002) |
| 2001 |
| 5 | EE | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm.
Computational Combinatorial Optimization 2001: 261-304 |
| 4 | EE | William Cook,
Sanjeeb Dash:
On the Matrix-Cut Rank of Polyhedra.
Math. Oper. Res. 26(1): 19-30 (2001) |
| 2000 |
| 3 | EE | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William Cook:
Cutting planes and the traveling salesman problem (abstract only).
SODA 2000: 429 |
| 1990 |
| 2 | EE | Vasek Chvátal,
William Cook:
The discipline number of a graph.
Discrete Mathematics 86(1-3): 191-198 (1990) |
| 1 | | William Cook:
Cutting-Plane Proofs in Polynomial Space.
Math. Program. 47: 11-18 (1990) |