default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam J. Cook
Person information
- affiliation: University of Waterloo, Canada
- award (2007): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]William J. Cook
, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder:
Local elimination in the traveling salesman problem. Math. Program. Comput. 16(4): 599-628 (2024)- [j32]William J. Cook, Stephan Held, Keld Helsgaun:
Constrained Local Search for Last-Mile Routing. Transp. Sci. 58(1): 12-26 (2024) - 2023
- [i1]William J. Cook, Keld Helsgaun, Stefan Hougardy, Rasmus T. Schroeder:
Local elimination in the traveling salesman problem. CoRR abs/2307.07054 (2023)
2010 – 2019
- 2019
- [p3]William J. Cook:
Computing in Combinatorial Optimization. Computing and Software Science 2019: 27-47 - 2013
- [j31]Vasek Chvátal, William J. Cook, Daniel G. Espinoza:
Local cuts for mixed-integer programming. Math. Program. Comput. 5(2): 171-200 (2013) - [j30]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3): 305-344 (2013) - 2012
- [j29]Stephan Held, William J. Cook, Edward C. Sewell:
Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4(4): 363-381 (2012) - 2011
- [j28]William J. Cook, Daniel E. Steffy:
Solving Very Sparse Rational Systems of Equations. ACM Trans. Math. Softw. 37(4): 39:1-39:21 (2011) - [c8]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
An Exact Rational Mixed-Integer Programming Solver. IPCO 2011: 104-116 - [c7]Stephan Held, William J. Cook, Edward C. Sewell:
Safe Lower Bounds for Graph Coloring. IPCO 2011: 261-273 - 2010
- [j27]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35(2): 479-493 (2010) - [p2]Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson:
Solution of a Large-Scale Traveling-Salesman Problem. 50 Years of Integer Programming 2010: 7-28 - [p1]William J. Cook:
Fifty-Plus Years of Combinatorial Integer Programming. 50 Years of Integer Programming 2010: 387-430
2000 – 2009
- 2009
- [j26]William J. Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea:
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21(4): 641-649 (2009) - [j25]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - [e4]William J. Cook, László Lovász, Jens Vygen:
Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany. Springer 2009, ISBN 978-3-540-76795-4 [contents] - 2007
- [j24]Alejandro A. Schäffer, Edward Stallknecht Rice, William J. Cook, Richa Agarwala:
rh_tsp_map 3.0: end-to-end radiation hybrid mapping with improved speed and quality control. Bioinform. 23(9): 1156-1158 (2007) - [j23]David Avis, J. Adrian Bondy, William J. Cook, Bruce A. Reed:
Vašek Chvátal: A Very Short Introduction. Graphs Comb. 23(Supplement-1): 41-65 (2007) - [j22]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). INFORMS J. Comput. 19(3): 356-365 (2007) - [j21]David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza:
Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007) - 2005
- [c6]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
A Study of Domino-Parity and k-Parity Constraints for the TSP. IPCO 2005: 452-467 - 2003
- [j20]David L. Applegate, William J. Cook, André Rohe:
Chained Lin-Kernighan for Large Traveling Salesman Problems. INFORMS J. Comput. 15(1): 82-92 (2003) - [j19]William J. Cook, Paul D. Seymour:
Tour Merging via Branch-Decomposition. INFORMS J. Comput. 15(3): 233-248 (2003) - [j18]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1-2): 91-153 (2003) - 2002
- [j17]David L. Applegate, William J. Cook, Sanjeeb Dash, André Rohe:
Solution of a Min-Max Vehicle Routing Problem. INFORMS J. Comput. 14(2): 132-143 (2002) - [c5]William J. Cook:
Solving Traveling Salesman Problems. ESA 2002: 1 - [e3]William J. Cook, Andreas S. Schulz:
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings. Lecture Notes in Computer Science 2337, Springer 2002, ISBN 3-540-43676-6 [contents] - 2001
- [j16]William J. Cook, Sanjeeb Dash:
On the Matrix-Cut Rank of Polyhedra. Math. Oper. Res. 26(1): 19-30 (2001) - [c4]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization 2001: 261-304 - 2000
- [c3]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook:
Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429
1990 – 1999
- 1999
- [j15]Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee:
Computational experience with parallel mixed integerprogramming in a distributed environment. Ann. Oper. Res. 90: 19-43 (1999) - [j14]William J. Cook, André Rohe:
Computing Minimum-Weight Perfect Matchings. INFORMS J. Comput. 11(2): 138-148 (1999) - 1995
- [e2]William J. Cook, László Lovász, Paul D. Seymour:
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20, DIMACS/AMS 1995, ISBN 978-0-8218-0239-7 [contents] - 1993
- [j13]William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross:
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming. INFORMS J. Comput. 5(2): 206-212 (1993) - 1992
- [j12]William J. Cook:
Federal law and the interstate transfer of stolen computer data: riggs and brown. Comput. Law Secur. Rev. 8(2): 77-80 (1992) - [j11]William J. Cook:
Trends in network liability: 1992. Comput. Law Secur. Rev. 8(5): 213-215 (1992) - [j10]William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid:
On integer points in polyhedra. Comb. 12(1): 27-37 (1992) - 1991
- [j9]David L. Applegate, William J. Cook:
A Computational Study of the Job-Shop Scheduling Problem. INFORMS J. Comput. 3(2): 149-156 (1991) - [j8]David L. Applegate, William J. Cook, S. Thomas McCormick:
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10(1): 37-41 (1991) - [c2]David L. Applegate, William J. Cook:
Solving Large-Scale Matching Problems. Network Flows And Matching 1991: 557-576 - 1990
- [j7]Vasek Chvátal, William J. Cook:
The discipline number of a graph. Discret. Math. 86(1-3): 191-198 (1990) - [j6]William J. Cook:
Cutting-Plane Proofs in Polynomial Space. Math. Program. 47: 11-18 (1990) - [j5]William J. Cook, Ravi Kannan, Alexander Schrijver:
Chvátal Closures for mixed Integer Programming Problems. Math. Program. 47: 155-174 (1990) - [c1]William J. Cook, Mark Hartmann:
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem. Polyhedral Combinatorics 1990: 75-82 - [e1]William J. Cook, Paul D. Seymour:
Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 1, DIMACS/AMS 1990, ISBN 978-0-8218-6591-0 [contents]
1980 – 1989
- 1987
- [j4]William J. Cook, Collette R. Coullard, György Turán:
On the complexity of cutting-plane proofs. Discret. Appl. Math. 18(1): 25-38 (1987) - 1986
- [j3]William J. Cook, Jean Fonlupt, Alexander Schrijver:
An integer analogue of Carathéodory's theorem. J. Comb. Theory B 40(1): 63-70 (1986) - [j2]William J. Cook:
On box totally dual integral polyhedra. Math. Program. 34(1): 48-61 (1986) - [j1]William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos:
Sensitivity theorems in integer linear programming. Math. Program. 34(3): 251-264 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
