Cook William

William Cook

Information about the author William Cook will soon be added to the site.
Found 11 papers in total
Certification of an optimal TSP tour through 85,900 cities
2009
We describe a computer code and data that together certify the optimality of a...
Numerically safe Gomory mixed-integer cuts
2009
We describe a simple process for generating numerically safe cutting planes using...
Computing with domino-parity inequalities for the traveling salesman problem (TSP)
2007
We describe methods for implementing separation algorithms for domino–parity...
Exact solutions to linear programming problems
2007
The use of floating-point calculations limits the accuracy of solutions obtained by...
Tour merging via branch-decomposition
2003
Robertson and Seymour introduced branch-width as a new connectivity invariant of...
Chained Lin–Kernighan for large traveling salesman problems
2003
We discuss several issues that arise in the implementation of Martin, Otto, and...
Solution of a min–max vehicle routing problem
2002
We use a branch-and-cut search to solve the Whizzkids'96 vehicle routing problem,...
Computational experience with parallel mixed integer programming in a distributed environment
1999
Numerical experiments for a parallel implementation of a branch-and-bound mixed 0/1...
Computing minimum-weight perfect matchings
1999
We make several observations on the implementation of Edmonds' blossom algorithm for...
Integral infeasibility and testing total dual integrality
1991
A number of well known results in combinatorial optimization, such as Hoffman’s...
Cutting-plane proofs in polynomial space
1990
Following Chvátal, cutting planes may be viewed as a proof system for...
Papers per page: