William J. Cook

According to our database, William J. Cook authored at least 42 papers between 1986 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Local elimination in the traveling salesman problem.

William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder

CoRR, 2023

2013

A hybrid branch-and-bound approach for exact rational mixed-integer programming.

William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter

Math. Program. Comput., 2013

Local cuts for mixed-integer programming.

Vasek Chvátal, William J. Cook, Daniel G. Espinoza

Math. Program. Comput., 2013

2012

Maximum-weight stable sets and safe lower bounds for graph coloring.

Stephan Held, William J. Cook, Edward C. Sewell

Math. Program. Comput., 2012

2011

Solving Very Sparse Rational Systems of Equations.

William J. Cook, Daniel E. Steffy

ACM Trans. Math. Softw., 2011

Safe Lower Bounds for Graph Coloring.

Stephan Held, William J. Cook, Edward C. Sewell

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

An Exact Rational Mixed-Integer Programming Solver.

William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem.

William J. Cook, Daniel G. Espinoza, Marcos Goycoolea

Math. Oper. Res., 2010

Fifty-Plus Years of Combinatorial Integer Programming.

William J. Cook

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

Solution of a Large-Scale Traveling-Salesman Problem.

Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Certification of an optimal TSP tour through 85, 900 cities.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun

Oper. Res. Lett., 2009

Numerically Safe Gomory Mixed-Integer Cuts.

William J. Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea

INFORMS J. Comput., 2009

2007

Exact solutions to linear programming problems.

David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza

Oper. Res. Lett., 2007

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).

William J. Cook, Daniel G. Espinoza, Marcos Goycoolea

INFORMS J. Comput., 2007

Vašek Chvátal: A Very Short Introduction.

David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed

Graphs Comb., 2007

rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control.

Alejandro A. Schäffer, Edward Stallknecht Rice, William J. Cook, Richa Agarwala

Bioinform., 2007

2005

A Study of Domino-Parity and k-Parity Constraints for the TSP.

William J. Cook, Daniel G. Espinoza, Marcos Goycoolea

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2003

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Math. Program., 2003

Tour Merging via Branch-Decomposition.

William J. Cook, Paul D. Seymour

INFORMS J. Comput., 2003

Chained Lin-Kernighan for Large Traveling Salesman Problems.

David L. Applegate, William J. Cook, André Rohe

INFORMS J. Comput., 2003

2002

Solution of a Min-Max Vehicle Routing Problem.

David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe

INFORMS J. Comput., 2002

Solving Traveling Salesman Problems.

William J. Cook

Proceedings of the Algorithms, 2002

2001

On the Matrix-Cut Rank of Polyhedra.

William J. Cook, Sanjeeb Dash

Math. Oper. Res., 2001

TSP Cuts Which Do Not Conform to the Template Paradigm.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Proceedings of the Computational Combinatorial Optimization, 2001

2000

Cutting planes and the traveling salesman problem (abstract only).

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Computing Minimum-Weight Perfect Matchings.

William J. Cook, André Rohe

INFORMS J. Comput., 1999

Computational experience with parallel mixed integerprogramming in a distributed environment.

Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee

Ann. Oper. Res., 1999

1993

An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming.

William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross

INFORMS J. Comput., 1993

1992

On integer points in polyhedra.

William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid

Comb., 1992

Trends in network liability: 1992.

William J. Cook

Comput. Law Secur. Rev., 1992

Federal law and the interstate transfer of stolen computer data: riggs and brown.

William J. Cook

Comput. Law Secur. Rev., 1992

1991

Integral infeasibility and testing total dual integrality.

David L. Applegate, William J. Cook, S. Thomas McCormick

Oper. Res. Lett., 1991

A Computational Study of the Job-Shop Scheduling Problem.

David L. Applegate, William J. Cook

INFORMS J. Comput., 1991

Solving Large-Scale Matching Problems.

David L. Applegate, William J. Cook

Proceedings of the Network Flows And Matching, 1991

1990

Chvátal Closures for mixed Integer Programming Problems.

William J. Cook, Ravi Kannan, Alexander Schrijver

Math. Program., 1990

Cutting-Plane Proofs in Polynomial Space.

William J. Cook

Math. Program., 1990

The discipline number of a graph.

Vasek Chvátal, William J. Cook

Discret. Math., 1990

On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem.

William J. Cook, Mark Hartmann

Proceedings of the Polyhedral Combinatorics, 1990

1987

On the complexity of cutting-plane proofs.

William J. Cook, Collette R. Coullard, György Turán

Discret. Appl. Math., 1987

1986

Sensitivity theorems in integer linear programming.

William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos

Math. Program., 1986

On box totally dual integral polyhedra.

William J. Cook

Math. Program., 1986

An integer analogue of Carathéodory's theorem.

William J. Cook, Jean Fonlupt, Alexander Schrijver

J. Comb. Theory, Ser. B, 1986