William J. Cook
From Wikipedia the free encyclopedia
William John Cook (born October 18, 1957 in New Jersey) is an American operations researcher and mathematician, and Professor of Combinatorics and Optimization at the University of Waterloo.
He was elected a member of the National Academy of Engineering in 2011 for theoretical and computational contributions to discrete optimization.[1]
He is known for his work on the traveling salesman problem and is one of the authors of the Concorde TSP Solver.
Professional career
[edit]Cook did his undergraduate studies at Rutgers University, graduating in 1979 with a bachelor's degree in mathematics. After earning a master's degree in operations research from Stanford University in 1980, he moved to the University of Waterloo, where he earned a Ph.D. in combinatorics and optimization in 1983 under the supervision of U. S. R. Murty.[2][3] After postdoctoral studies at the University of Bonn, he joined the Cornell University faculty in 1985, moved to Columbia University in 1987, and in 1988 joined the research staff of Bell Communications Research. In 1994 he returned to academia as John von Neumann Professor at the University of Bonn, and in 1996 he moved to Rice University as Noah Harding Professor of Computational and Applied Mathematics. In 2002 he took his position at Georgia Tech.[2] In January 2013, he moved to the University of Pittsburgh as the John Swanson Professor of Industrial Engineering, before returning to the University of Waterloo in June 2013 as a professor in the Department of Combinatorics and Optimization, and subsequently University Professor.[2] From 2018-2020 he worked at Johns Hopkins University as a Professor of Applied Mathematics and Statistics.
He is the founding editor-in-chief of the journal Mathematical Programming Computation (since 2008), and the former editor-in-chief of Mathematical Programming (Series B from 1993 to 2003, and Series A from 2003 to 2007).[2]
Awards and honors
[edit]In 1998 he was an Invited Speaker at the International Congress of Mathematicians in Berlin.[4] He won the Beale–Orchard-Hays Prize of the Mathematical Programming Society in 2000,[5] and his book The Traveling Salesman Problem: A Computational Study won the Frederick W. Lanchester Prize of INFORMS in 2007.[6]
He became a fellow of the Society for Industrial and Applied Mathematics in 2009, and of INFORMS in 2010.[2] He was elected to the National Academy of Engineering in 2011.[1] In 2012 he became a fellow of the American Mathematical Society.[7]
Selected publications
[edit]Books
[edit]- Combinatorial Optimization (with William Cunningham, William R. Pulleyblank, and Alexander Schrijver, John Wiley and Sons, 1998); 2011 pbk reprint
- The Traveling Salesman Problem: A Computational Study (with David L. Applegate, Robert E. Bixby, and Václav Chvátal, Princeton University Press, 2006; Frederick W. Lanchester Prize, 2007)[6]
- In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, Princeton University Press, 2012.[8]
References
[edit]- ^ a b National Academy of Engineering member profile, retrieved 2013-01-23.
- ^ a b c d e Curriculum vitae, retrieved 2018-07-11.
- ^ William John Cook at the Mathematics Genealogy Project
- ^ Applegate, David; Bixby, Robert; Cook, William; Chvátal, Vašek (1998). "On the solution of traveling salesman problems". Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. III. pp. 645–656.
- ^ Beale–Orchard-Hays past winners, Mathematical Programming Society, retrieved 2013-01-23.
- ^ a b Lanchester Prize citation Archived October 26, 2015, at the Wayback Machine, INFORMS, retrieved 2013-01-23.
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-01-21.
- ^ Thompson, Christopher (2012). "Review of In Pursuit of the Traveling Salesman by William J. Cook". MAA Reviews, Mathematical Association of America.
