Английская Википедия:George Nemhauser
Шаблон:Short description Шаблон:Infobox scientist
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, Шаблон:MR)
- Integer and Combinatorial Optimization (with Laurence A. Wolsey, Wiley, 1988, Шаблон:MR).
- 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
External links
- Biography of George Nemhauser from the Institute for Operations Research and the Management Sciences
Шаблон:John von Neumann Theory Prize recipients Шаблон:Authority control
- ↑ 1,0 1,1 Шаблон:Citation.
- ↑ 2,0 2,1 2,2 2,3 ORSA Presidential Portrait Gallery: George L. Nemhauser, retrieved 2012-02.25.
- ↑ Шаблон:Mathgenealogy
- ↑ Шаблон:Citation.
- ↑ Шаблон:Citation.
- ↑ Шаблон:Citation.
- ↑ Шаблон:Citation.
- ↑ Шаблон:Citation
- ↑ ISyE Faculty Named Inaugural SIAM Fellows Шаблон:Webarchive, retrieved 2012-02.25.
- ↑ Award Recipients: George L. Nemhauser Шаблон:Webarchive, INFORMS Online, retrieved 2012-02-25.
- ↑ [1], Announcement by INFORMS
- Английская Википедия
- 1937 births
- Living people
- American operations researchers
- City College of New York alumni
- Robert R. McCormick School of Engineering and Applied Science alumni
- Johns Hopkins University faculty
- Georgia Tech faculty
- Cornell University faculty
- Fellows of the Institute for Operations Research and the Management Sciences
- Members of the United States National Academy of Engineering
- John von Neumann Theory Prize winners
- Scientists from the Bronx
- American chemical engineers
- Страницы, где используется шаблон "Навигационная таблица/Телепорт"
- Страницы с телепортом
- Википедия
- Статья из Википедии
- Статья из Английской Википедии
