William Cook (mathematician)

from Wikipedia, the free encyclopedia
William Cook

William John Cook (born October 18, 1957 in New Jersey ) is an American mathematician whose specialty is linear and integer optimization . In addition to his contributions to various graph-theoretic problems such as the matching problem , he is best known for his work on the traveling salesman (TSP) problem . In the context of this optimization problem, Cook made significant contributions to the further development of cutting plane and branch-and-cut methods, some of which are now also used as standard for the solution of other integer optimization problems. The branch-and-cut-based program Concorde, which he helped to develop to solve the problem of the traveling salesman, has been involved in all TSP records in recent years.

academic career

Cook earned a bachelor's degree in mathematics from Rutgers University in 1979 and a master's degree in operations research from Stanford University a year later . Three years later he earned his doctorate from the University of Waterloo in Ontario , Canada ( On Some Aspects of Totally Dual Integral Systems ). After a two-year stay at the Institute for Operations Research in Bonn , he spent some time as a research fellow at Cornell University and Columbia University before moving to Bellcore in 1988 .

After a further year and a half in Bonn, he was appointed professor of applied mathematics at Rice University in Texas in 1996 , where he researched methods of solving the traveling salesman problem with Robert Bixby and David Applegate, among others . After a stay at Princeton University from 2000 to 2002, Cook moved to Georgia Tech , where he was a professor until 2012. Since the beginning of 2013 he has been Professor of Combinatorics and Optimization at the University of Waterloo . He is a Fellow of the American Mathematical Society and the Institute for Operations Research and Management Science (INFORMS) .

He is editor of the journal Mathematical Programming, Series A .

Awards and honors


  • With: William Cunningham, Alexander Schrijver: Combinatorial Optimization. John Wiley and Sons, New York, 1998.
  • With: Paul Seymour: Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 1, American Mathematical Society , 1990.
  • With: David Applegate, Robert Bixby, Vašek Chvátal: On the Solution of Traveling Salesman Problems. In: Documenta Mathematica , Extra Volume III for the International Congress of Mathematicians 1998, pages 645–656. ( Postscript ; GZIP ; 68 kB)
  • With László Lovász , Jens Vygen : Research Trends in Combinatorial Optimization. Springer-Verlag, Berlin 2009, ISBN 978-3-540-76795-4 .

Web links

Individual evidence

  1. ^ William Cook in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ William J. Cook: CV. University of Waterloo, accessed January 24, 2019 .
  3. Allyn Jackson: Fellows of the AMS: Inaugural Class . In: American Mathematical Society (Ed.): Notices of the AMS . May 2013, p. 631-633 ( ams.org [PDF]).
  4. ^ INFORMS Fellows Class of 2010. Institute for Operations Research and Management Science, accessed January 24, 2019 .
  5. ^ Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 .