William Cook - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2023

2021

Machine Learning for Conservative-to-Primitive in Relativistic HydrodynamicsTobias Dieselhorst, William Cook, Sebastiano Bernuzzi, David Radice. symmetry, 13(11):2157, 2021. [doi]

2019

Computing in Combinatorial OptimizationWilliam Cook. In VIDEO: Lecture Notes in Computer Science Celebrates 10,000th Manuscript!. Volume 10000 of Lecture Notes in Computer Science, pages 27-47, Springer, 2019. [doi]

2018

AirborneCPS: A Simulator for Functional Dependencies in Cyber Physical Systems: A Traffic Collision Avoidance System ImplementationWilliam Cook, Andrew Driscoll, Bastian Tenbergen. RE 2018: 32-35 [doi]

2013

A hybrid branch-and-bound approach for exact rational mixed-integer programmingWilliam Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter. mpc, 5(3):305-344, 2013. [doi]

2012

Maximum-weight stable sets and safe lower bounds for graph coloringStephan Held, William Cook, Edward C. Sewell. mpc, 4(4):363-381, 2012. [doi]

2011

Solving Very Sparse Rational Systems of EquationsWilliam Cook, Daniel E. Steffy. TOMS, 37(4):39, 2011. [doi]

An Exact Rational Mixed-Integer Programming SolverWilliam Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter. ipco 2011: 104-116 [doi]

Safe Lower Bounds for Graph ColoringStephan Held, William Cook, Edward C. Sewell. ipco 2011: 261-273 [doi]

2010

Fifty-Plus Years of Combinatorial Integer ProgrammingWilliam Cook. In Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey, editors, 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. pages 387-430, Springer, 2010. [doi]

2009

2008

Event Structure Semantics of OrcSidney Rosario, David Kitchin, Albert Benveniste, William R. Cook, Stefan Haar, Claude Jard. In Web Services and Formal Methods. 2008: 154-168 [doi]

2007

Exact solutions to linear programming problemsDavid Applegate, William Cook, Sanjeeb Dash, Daniel Espinoza. orl, 35(6):693-699, 2007. [doi]

Vašek Chvátal: A Very Short IntroductionDavid Avis, Adrian Bondy, William Cook, Bruce A. Reed. gc, 23(Supplement-1):41-65, 2007. [doi]

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)William Cook, Daniel Espinoza, Marcos Goycoolea. informs, 19(3):356-365, 2007. [doi]

rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality controlAlejandro A. Schäffer, Edward Stallknecht Rice, William Cook, Richa Agarwala. bioinformatics, 23(9):1156-1158, 2007. [doi]

2005

A Study of Domino-Parity and k-Parity Constraints for the TSPWilliam Cook, Daniel Espinoza, Marcos Goycoolea. ipco 2005: 452-467 [doi]

2003

Chained Lin-Kernighan for Large Traveling Salesman ProblemsDavid Applegate, William Cook, André Rohe. informs, 15(1):82-92, 2003. [doi]

Tour Merging via Branch-DecompositionWilliam Cook, Paul D. Seymour. informs, 15(3):233-248, 2003. [doi]

2002

Solution of a Min-Max Vehicle Routing ProblemDavid Applegate, William Cook, Sanjeeb Dash, André Rohe. informs, 14(2):132-143, 2002. [doi]

Solving Traveling Salesman ProblemsWilliam Cook. esa 2002: 1 [doi]

2001

TSP Cuts Which Do Not Conform to the Template ParadigmDavid Applegate, Robert E. Bixby, Vasek Chvátal, William Cook. cco 2001: 261-304 [doi]

On the Matrix-Cut Rank of PolyhedraWilliam Cook, Sanjeeb Dash. mor, 26(1):19-30, 2001. [doi]

2000

Cutting planes and the traveling salesman problem (abstract only)David Applegate, Robert E. Bixby, Vasek Chvátal, William Cook. soda 2000: 429 [doi]

1999

Computing Minimum-Weight Perfect MatchingsWilliam Cook, AndrÃ© Rohe. informs, 11(2):138-148, 1999. [doi]

1993

An Implementation of the Generalized Basis Reduction Algorithm for Integer ProgrammingWilliam Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross. informs, 5(2):206-212, 1993. [doi]

1991

A Computational Study of the Job-Shop Scheduling ProblemDavid Applegate, William Cook. informs, 3(2):149-156, 1991. [doi]

1990

The discipline number of a graphVasek Chvátal, William Cook. DM, 86(1-3):191-198, 1990. [doi]

Cutting-Plane Proofs in Polynomial SpaceWilliam Cook. mp, 47:11-18, 1990.

1987

On the complexity of cutting-plane proofsWilliam Cook, Collette R. Coullard, György Turán. DAM, 18(1):25-38, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL