William J. Cook

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