William J. Cook

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 2

Top Topics

Traveling Salesman

Search Algorithm

Combinatorial Optimization

Hard Constraints

Top Venues

Publications

William J. Cook, Stephan Held, Keld Helsgaun
Constrained Local Search for Last-Mile Routing. Transp. Sci. 58 (1) (2024)
William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder
Local elimination in the traveling salesman problem. CoRR (2023)
William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5 (3) (2013)
Vasek Chvátal, William J. Cook, Daniel G. Espinoza
Local cuts for mixed-integer programming. Math. Program. Comput. 5 (2) (2013)
Stephan Held, William J. Cook, Edward C. Sewell
Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4 (4) (2012)
William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
An Exact Rational Mixed-Integer Programming Solver. IPCO (2011)
Stephan Held, William J. Cook, Edward C. Sewell
Safe Lower Bounds for Graph Coloring. IPCO (2011)
William J. Cook, Daniel E. Steffy
Solving Very Sparse Rational Systems of Equations. ACM Trans. Math. Softw. 37 (4) (2011)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35 (2) (2010)
William J. Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21 (4) (2009)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37 (1) (2009)
David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza
Exact solutions to linear programming problems. Oper. Res. Lett. 35 (6) (2007)
Alejandro A. Schäffer, Edward Stallknecht Rice, William J. Cook, Richa Agarwala
rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control. Bioinform. 23 (9) (2007)
David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23 (Supplement-1) (2007)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). INFORMS J. Comput. 19 (3) (2007)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
A Study of Domino-Parity and k-Parity Constraints for the TSP. IPCO (2005)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97 (1-2) (2003)
David L. Applegate, William J. Cook, André Rohe
Chained Lin-Kernighan for Large Traveling Salesman Problems. INFORMS J. Comput. 15 (1) (2003)
William J. Cook, Paul D. Seymour
Tour Merging via Branch-Decomposition. INFORMS J. Comput. 15 (3) (2003)
William J. Cook
Solving Traveling Salesman Problems. ESA (2002)
David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe
Solution of a Min-Max Vehicle Routing Problem. INFORMS J. Comput. 14 (2) (2002)
William J. Cook, Sanjeeb Dash
On the Matrix-Cut Rank of Polyhedra. Math. Oper. Res. 26 (1) (2001)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization (2001)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Cutting planes and the traveling salesman problem (abstract only). SODA (2000)
William J. Cook, André Rohe
Computing Minimum-Weight Perfect Matchings. INFORMS J. Comput. 11 (2) (1999)
Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee
Computational experience with parallel mixed integerprogramming in a distributed environment. Ann. Oper. Res. 90 (1999)
William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming. INFORMS J. Comput. 5 (2) (1993)
William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid
On integer points in polyhedra. Comb. 12 (1) (1992)
William J. Cook
Trends in network liability: 1992. Comput. Law Secur. Rev. 8 (5) (1992)
William J. Cook
Federal law and the interstate transfer of stolen computer data: riggs and brown. Comput. Law Secur. Rev. 8 (2) (1992)
David L. Applegate, William J. Cook, S. Thomas McCormick
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10 (1) (1991)
David L. Applegate, William J. Cook
Solving Large-Scale Matching Problems. Network Flows And Matching (1991)
David L. Applegate, William J. Cook
A Computational Study of the Job-Shop Scheduling Problem. INFORMS J. Comput. 3 (2) (1991)
William J. Cook, Ravi Kannan, Alexander Schrijver
Chvátal Closures for mixed Integer Programming Problems. Math. Program. 47 (1990)
William J. Cook
Cutting-Plane Proofs in Polynomial Space. Math. Program. 47 (1990)
Vasek Chvátal, William J. Cook
The discipline number of a graph. Discret. Math. 86 (1-3) (1990)
William J. Cook, Mark Hartmann
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem. Polyhedral Combinatorics (1990)
William J. Cook, Collette R. Coullard, György Turán
On the complexity of cutting-plane proofs. Discret. Appl. Math. 18 (1) (1987)
William J. Cook, Jean Fonlupt, Alexander Schrijver
An integer analogue of Carathéodory's theorem. J. Comb. Theory, Ser. B 40 (1) (1986)
William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos
Sensitivity theorems in integer linear programming. Math. Program. 34 (3) (1986)
William J. Cook
On box totally dual integral polyhedra. Math. Program. 34 (1) (1986)