Jump to content

George Nemhauser

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Gglockner (talk | contribs) at 19:13, 22 June 2022 (Added Nemhauser's retirement year for Georgia Tech). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

George Nemhauser
Nemhauser in 2005
Born1937
The Bronx, New York
Alma materCity College of New York (B.Ch.E., 1958)
Northwestern University (M.S., 1959) (PH.D., 1961)
AwardsLanchester Prize (1977, 1990)
George E. Kimball Medal (1988)
Khachiyan Prize (2010)
John Von Neumann Theory Prize (2012)
Scientific career
FieldsOperations Research
InstitutionsJohns Hopkins University (1961–1969)
Cornell University (1970–1983)
Georgia Institute of Technology (1985–2021 )
Doctoral studentsGérard Cornuéjols

George Lann Nemhauser (born 1937)[1] is an American operations researcher, the A. Russell Chandler III Chair and Institute Professor of Industrial and Systems Engineering at the Georgia Institute of Technology and the former president of the Operations Research Society of America.[2]

Biography

Nemhauser was born in The Bronx, New York,[1] and did his undergraduate education at the City College of New York, graduating with a degree in chemical engineering in 1958. He earned his Ph.D. in operations research in 1961 from Northwestern University, under the supervision of Jack Mitten.[3] He taught at Johns Hopkins University from 1961 to 1969, and then moved to Cornell University, where he held the Leon C. Welch endowed chair in operations research. He moved to the Georgia Institute of Technology in 1985.[2]

He was president of ORSA in 1981, chair of the Mathematical Programming Society, and founding editor of the journal Operations Research Letters.[2]

Research

Nemhauser's research concerns large mixed integer programming problems and their applications.[4] He is one of the co-inventors of the branch and price method for solving integer linear programs.[5] He also contributed important early studies of approximation algorithms for facility location problems[6] and for submodular optimization.[7] Nemhauser, together with Leslie Trotter, showed in 1975 that the optimal solution to the weighted vertex cover problem contains all the nodes that have a value of 1 in the linear programming relaxation as well as some of the nodes that have a value of 0.5.[8]

Books

Nemhauser is the author of

  • Introduction to Dynamic Programming (Wiley, 1966)
  • Integer Programming (with Robert Garfinkel, Wiley, 1972, MR0381688)
  • Integer and Combinatorial Optimization (with Laurence A. Wolsey, Wiley, 1988, MR0948455).
  • Optimization (with A. H. G. Rinnooy Kan and Michael J. Todd, North-Holland, 1989)

Awards and honors

Nemhauser was elected as a member of the National Academy of Engineering in 1986, a fellow of INFORMS in 2002, and a fellow of the Society for Industrial and Applied Mathematics in 2008.[2][9] He has won five awards from INFORMS: the George E. Kimball Medal for distinguished service to INFORMS and to the profession in 1988, the Frederick W. Lanchester Prize in 1977 for a paper on approximation algorithms for facility location and again in 1989 for his textbook Integer and Combinatorial Optimization, the Phillip McCord Morse Lectureship Award in 1992, the first Optimization Society Khachiyan Prize for Life-time Accomplishments in Optimization in 2010,[10] and the John von Neumann Theory Prize in 2012 (together with Laurence Wolsey).[11]

References

  1. ^ a b Pousner, Michael (Winter 1993), "Optimal Efficiency; Profile: Dr. George L. Nemhauser", Georgia Tech Alumni Magazine, 68 (3), archived from the original on 2007-09-09.
  2. ^ a b c d ORSA Presidential Portrait Gallery: George L. Nemhauser, retrieved 2012-02.25.
  3. ^ George Lann Nemhauser at the Mathematics Genealogy Project
  4. ^ "EAC Focus – George Nemhauser", Parallel Computing Research, 4 (1), Center for Research on Parallel Computation, 1996.
  5. ^ Barnhart, Cynthia; Johnson, Ellis L.; Nemhauser, George L.; Savelsbergh, Martin W. P.; Vance, Pamela H. (1998), "Branch-and-price: column generation for solving huge integer programs", Operations Research, 46 (3): 316–329, doi:10.1287/opre.46.3.316, JSTOR 222825.
  6. ^ Cornuejols, Gerard; Fisher, Marshall L.; Nemhauser, George L. (1977), "Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms", Management Science, 23 (8), INFORMS: 789–810, doi:10.1287/mnsc.23.8.789, JSTOR 2630709.
  7. ^ Nemhauser, G. L.; Wolsey, L. A.; Fisher, M. L. (1978), "An analysis of approximations for maximizing submodular set functions I", Mathematical Programming, 14 (1): 265–294, doi:10.1007/BF01588971, S2CID 206800425.
  8. ^ Nemhauser, George; Trotter, Leslie (1975), "Vertex packings: Structural properties and algorithms", Mathematical Programming, 8: 232–248, doi:10.1007/bf01580444, S2CID 869383
  9. ^ ISyE Faculty Named Inaugural SIAM Fellows Archived 2012-02-20 at the Wayback Machine, retrieved 2012-02.25.
  10. ^ Award Recipients: George L. Nemhauser Archived 2015-10-16 at the Wayback Machine, INFORMS Online, retrieved 2012-02-25.
  11. ^ [1], Announcement by INFORMS
Retrieved from "https://en.wikipedia.org/w/index.php?title=George_Nemhauser&oldid=1094460496"