The 1975 findings published by George Nemhauser and Leslie Trotter established critical bounds for the weighted vertex cover problem, identifying how linear programming relaxation values map to optimal solutions. This work remains a fundamental component of combinatorial optimization, reflecting his broader influence on mixed integer programming methods used to solve complex logistical and industrial challenges across the globe.
Academic Foundation
Born in 1937 in the Bronx, New York City, Nemhauser completed his undergraduate studies at the City College of New York, graduating with a degree in chemical engineering in 1958. He subsequently pursued advanced studies at Northwestern University, where he earned a Ph.D. in operations research in 1961 under the supervision of Jack Mitten. His early career included faculty appointments at Johns Hopkins University between 1961 and 1969, followed by a tenure at Cornell University as the Leon C. Welch endowed chair in operations research.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Optimization
Nemhauser joined the Georgia Institute of Technology in 1985, eventually becoming the A. Russell Chandler III Chair and Institute Professor of Industrial and Systems Engineering. His research focuses on large mixed integer programming problems and their real-world applications. He co-developed the branch and price method, a significant technique for solving integer linear programs. Additionally, he conducted early studies regarding submodular optimization and approximation algorithms for facility location problems. His pedagogical influence includes authorship of foundational texts such as Introduction to Dynamic Programming, Integer Programming, and Integer and Combinatorial Optimization.
Professional Service and Recognition
Throughout his career, Nemhauser provided extensive service to his field, serving as president of the Operations Research Society of America in 1981 and as a founding editor of the journal Operations Research Letters. He also chaired the Mathematical Programming Society. His contributions have been recognized with numerous honors, including the Frederick W. Lanchester Prize in 1977 and 1989, the George E. Kimball Medal in 1988, and the Phillip McCord Morse Lectureship Award in 1992. He was elected to the National Academy of Engineering in 1986, became a fellow of the Society for Industrial and Applied Mathematics in 2009, and received the John von Neumann Theory Prize in 2012.
Fast facts
- Born: 1937, New York City
- Undergraduate Degree: Chemical Engineering, City College of New York (1958)
- Ph.D.: Operations Research, Northwestern University (1961)
- Notable Academic Appointments: Johns Hopkins, Cornell, Georgia Tech
- National Academy of Engineering: Member (elected 1986)
- John von Neumann Theory Prize: 2012
- Frederick W. Lanchester Prize: 1977 and 1989
Questions readers ask
Which major academic institutions employed George Nemhauser?
He held positions at Johns Hopkins University, Cornell University, and the Georgia Institute of Technology.
What is his most recognized research contribution?
He is recognized for his work on mixed integer programming, the branch and price method, and his analysis of the weighted vertex cover problem with Leslie Trotter.
Achievements
- John von Neumann Theory Prize — 2012
- Frederick W. Lanchester Prize — 1977
- Held posts at Johns Hopkins University, Cornell University and Georgia Tech
