William J. Cook

William J. Cook
Name	William J. Cook
Birth date	1957
Birth place	Ames, Iowa
Nationality	American
Fields	Operations research; Combinatorial optimization; Computer science
Workplaces	Naval Postgraduate School, Georgia Institute of Technology, University of Waterloo, Carnegie Mellon University, Cornell University
Alma mater	Iowa State University, Cornell University
Doctoral advisor	Rudolf E. Kálmán
Known for	Concorde TSP software; contributions to traveling salesman problem, integer programming, polyhedral combinatorics
Awards	W. T. and Idalia Reid Prize, Fulkerson Prize, INFORMS Fellow

William J. Cook is an American mathematician and computer scientist known for work in combinatorial optimization, integer programming, and the traveling salesman problem. He has developed influential algorithms, software systems, and theoretical results bridging mathematical programming, graph theory, and practical computation. His career spans positions in North American research universities and leadership of collaborative projects that connected academia, industry, and national laboratories.

Early life and education

Cook was born in Ames, Iowa, and received his undergraduate education at Iowa State University before pursuing graduate study at Cornell University. At Cornell he completed doctoral work under the supervision of Rudolf E. Kálmán, situating his training at the intersection of control theory, optimization, and algorithmic mathematics. Cook's early exposure to quantitative problems at Iowa State and his formative research environment at Cornell connected him to networks including researchers from Bell Labs, IBM, and other applied mathematics centers.

Academic and professional career

Cook has held faculty and research positions at several prominent institutions. He served on the faculty at the University of Waterloo, where he interacted with scholars from the Ontario Institute for Studies in Education and collaborated with researchers across Canada and the United States. Later appointments included positions at Georgia Institute of Technology and leadership roles involving interdisciplinary centers that connected to National Science Foundation initiatives. Cook has also been affiliated with the Naval Postgraduate School and collaborated with scientists at Lawrence Livermore National Laboratory and Sandia National Laboratories on large-scale optimization efforts. Throughout his career he has advised doctoral students who went on to positions at organizations such as Microsoft Research, Google Research, AT&T Labs, and major universities.

Research contributions and notable work

Cook is widely recognized for advancing both practical and theoretical aspects of the traveling salesman problem (TSP). He led the development of the Concorde TSP software, which incorporated methods from branch-and-cut, linear programming, and cutting-plane theory to solve large TSP instances. Concorde interfaced with solvers and techniques from the worlds of IBM ILOG CPLEX, SYMPHONY, and specialized cutting-plane generators. His work connected polyhedral investigations of the TSP polytope with computational experiments on instances from repositories like the TSPLIB collection.

Beyond the TSP, Cook's contributions span integer programming and polyhedral combinatorics, including studies of facet-defining inequalities, separation algorithms, and complexity classification results linked to NP-completeness and Karp's 21 NP-complete problems. He has co-authored influential results on branch-and-cut strategies that brought together methods from Gomory, Dantzig, and modern computational environments. Cook's collaborations included partnerships with researchers such as David Applegate, Matthew Chanin, Michel Goemans, and Mihalis Yannakakis, and intersected with conferences such as the Symposium on Theory of Computing, the Integer Programming and Combinatorial Optimization Conference, and the Annual Meeting of INFORMS.

Awards and honors

Cook's recognition includes major awards and fellowships. He received the Fulkerson Prize for outstanding papers in discrete mathematics, the W. T. and Idalia Reid Prize for contributions to mathematical aspects of operations research, and was elected an INFORMS Fellow for lifetime achievement in operations research and the management sciences. His work has been recognized by prizes at meetings of the Mathematical Optimization Society and invitations to give plenary addresses at venues including the International Congress of Mathematicians and the SIAM Annual Meeting.

Selected publications

- Applegate, D., Cook, W., and Rohe, A., "Chained Lin-Kernighan for large traveling salesman problems", published in proceedings and widely cited within combinatorial optimization literature. - Cook, W., "The traveling salesman problem: a computational study", a comprehensive monograph summarizing algorithms, polyhedral theory, and computational experiments connected to the TSP and cutting-plane methods. - Cook, W., and others, papers on branch-and-cut methodology, facet-defining inequalities, and computational treatments of integer programming appearing in journals such as the Mathematical Programming, Operations Research, and the Journal of the ACM. These works link to algorithmic traditions initiated by figures like Jon Lee, R. L. Graham, Jack Edmonds, and George Dantzig.

Personal life and legacy

Cook's legacy includes both his theoretical contributions and the software infrastructure he helped create, most notably Concorde, which remains a benchmark in computational optimization and is used by researchers at institutions such as Princeton University, Massachusetts Institute of Technology, and Stanford University. His mentorship produced a generation of researchers who continued work at companies including Amazon, Facebook, and national laboratories. Cook's combination of rigorous polyhedral analysis and practical algorithm engineering linked traditions from Bell Labs-era algorithmic research to contemporary high-performance computing environments, influencing curricula at departments of Mathematics and Computer Science across North America.

Category:American mathematicians Category:Combinatorial optimization Category:Living people