William Cook

Available identifiers

zbMath Open cook.william-johnWikidataQ2578302 ScholiaQ2578302MaRDI QIDQ744211

List of research outcomes

Publication	Date of Publication	Type
Constrained Local Search for Last-Mile Routing	2021-12-30	Paper
Solving Very Sparse Rational Systems of Equations	2017-05-19	Paper
In Pursuit of the Traveling Salesman	2014-12-03	Paper
A hybrid branch-and-bound approach for exact rational mixed-integer programming	2014-10-06	Paper
Local cuts for mixed-integer programming	2013-08-05	Paper
Markowitz and Manne + Eastman + Land and Doig = branch and bound	2013-04-17	Paper
Maximum-weight stable sets and safe lower bounds for graph coloring	2013-04-10	Paper
Numerically Safe Gomory Mixed-Integer Cuts	2012-07-28	Paper
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)	2012-06-18	Paper
Solution of a Min-Max Vehicle Routing Problem	2012-05-30	Paper
Chained Lin-Kernighan for Large Traveling Salesman Problems	2012-05-30	Paper
Tour Merging via Branch-Decomposition	2012-05-30	Paper
In Pursuit of the Traveling Salesman	2012-01-17	Paper
An Exact Rational Mixed-Integer Programming Solver	2011-06-24	Paper
Safe Lower Bounds for Graph Coloring	2011-06-24	Paper
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem	2011-04-27	Paper
Solution of a Large-Scale Traveling-Salesman Problem	2010-06-03	Paper
Fifty-Plus Years of Combinatorial Integer Programming	2010-06-03	Paper
Certification of an optimal TSP tour through 85,900 cities	2009-02-23	Paper
Exact solutions to linear programming problems	2008-01-21	Paper
A Study of Domino-Parity and k-Parity Constraints for the TSP	2007-08-30	Paper
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)	2007-07-19	Paper
https://portal.mardi4nfdi.de/entity/Q3425132	2007-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q4735941	2004-08-09	Paper
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems	2003-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q4411337	2003-07-08	Paper
On the Matrix-Cut Rank of Polyhedra	2001-11-26	Paper
Computational experience with parallel mixed integer programming in a distributed environment	1999-12-02	Paper
Computing Minimum-Weight Perfect Matchings	1999-01-01	Paper
On the solution of traveling salesman problems	1998-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4371290	1998-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4283461	1994-05-15	Paper
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming	1994-01-03	Paper
A Computational Study of the Job-Shop Scheduling Problem	1993-02-18	Paper
The discipline number of a graph	1992-06-25	Paper
Cutting-plane proofs in polynomial space	1992-06-25	Paper
Integral infeasibility and testing total dual integrality	1991-01-01	Paper
Chvátal closures for mixed integer programming problems	1990-01-01	Paper
On the complexity of cutting-plane proofs	1987-01-01	Paper
Linear Systems for Constrained Matching Problems	1987-01-01	Paper
An integer analogue of Carathéodory's theorem	1986-01-01	Paper
On box totally dual integral polyhedra	1986-01-01	Paper
Sensitivity theorems in integer linear programming	1986-01-01	Paper
A note on matchings and separability	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3682243	1985-01-01	Paper
A polynomial-time test for total dual integrality in fixed dimension	1984-01-01	Paper
Operations that preserve total dual integrality	1983-01-01	Paper
A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: William Cook