World's Best Scientists 2026 revealed!
Award Badge
Engineering and Technology
USA
2026
Award Badge
Mathematics
USA
2026

D-Index & Metrics

Mathematics

D-Index
85
Citations
62905
World Ranking
100
National Ranking
56

Engineering and Technology

D-Index
88
Citations
64142
World Ranking
307
National Ranking
103

Research.com Recognitions

  • 2026 - Research.com Engineering and Technology in United States Leader Award
  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Engineering and Technology in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2012 - INFORMS John von Neumann Theory Prize
  • 2010 - Khachiyan Prize of the INFORMS Optimization Society
  • 2009 - SIAM Fellow For contributions to scheduling methodology and large-scale combinatorial optimization problems.
  • 2002 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
  • 1986 - Member of the National Academy of Engineering For fundamental operations-research contributions in scheduling methodology, and for contributions to large-scale combinatorial optimization problems.

Overview

George L. Nemhauser is affiliated with the Georgia Institute of Technology in the United States. Their research spans multiple areas bridging engineering and computer science, focusing on operational and optimization challenges within complex systems.

The main fields of study for Nemhauser include Engineering and Computer Science. More specifically, their work frequently addresses subfields such as Industrial and Manufacturing Engineering, Management Science and Operations Research, Transportation, Control and Systems Engineering, and Computer Networks and Communications.

Nemhauser's scholarly output covers several core topics including Vehicle Routing Optimization Methods, Transportation Planning and Optimization, Risk and Portfolio Optimization, Facility Location and Emergency Management, Optimization and Mathematical Programming, Optimization and Search Problems, and Data Management and Algorithms.

Some of their recent papers published are:

  • Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (2021, INFORMS Journal on Computing)
  • Distributionally Robust Disaster Relief Planning Under the Wasserstein Set (2024, Computers & Operations Research)
  • Decomposition of Loosely Coupled Integer Programs: A Multiobjective Perspective (2022, Mathematical Programming)
  • Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (2020, INFORMS Journal on Computing)
  • Decentralized Algorithms for Distributed Integer Programming Problems with a Coupling Cardinality Constraint (2020, Discrete Optimization)

Nemhauser collaborates regularly with several researchers, including:

  • Natashia Boland
  • Shabbir Ahmed
  • Edward He
  • Martin Savelsbergh
  • Ezgi Karabulut

Their research is frequently published in venues such as INFORMS Journal on Computing, Computers & Operations Research, Mathematical Programming, Discrete Optimization, and Networks.

Throughout their career, Nemhauser has received notable awards including the INFORMS John von Neumann Theory Prize in 2012, the Khachiyan Prize of the INFORMS Optimization Society in 2010, and distinctions as a Fellow of SIAM and the Institute for Operations Research and the Management Sciences (INFORMS). They were also elected as a Member of the National Academy of Engineering in 1986 for contributions related to scheduling methodology and large-scale combinatorial optimization problems.

Best Publications

  • Integer and Combinatorial Optimization

    George L. Nemhauser;Laurence A. Wolsey

  • An analysis of approximations for maximizing submodular set functions--I

    G. L. Nemhauser;L. A. Wolsey;M. L. Fisher

  • An analysis of approximations for maximizing submodular set functions II

    M.L. Fisher;G.L. Nemhauser;Laurence Wolsey

  • Integer programming

    G. L. Nemhauser;L. A. Wolsey

  • Branch-And-Price: Column Generation for Solving Huge Integer Programs

    Cynthia Barnhart;Ellis L. Johnson;George L. Nemhauser;Martin W. P. Savelsbergh

  • Integer and Combinatorial Optimization: Nemhauser/Integer and Combinatorial Optimization

    George Nemhauser;Laurence Wolsey

  • Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

    Gerard Cornuejols;Marshall L. Fisher;George L. Nemhauser

  • An analysis of approximations for maximizing submodular set functions - 1

    M.L. Fisher;G.L. Nemhauser;L.A. Wolsey

  • Introduction to dynamic programming

    George L. Nemhauser

  • A model and an algorithm for the dynamic traffic assignment problems

    Deepak K. Merchant;George L. Nemhauser

  • The Uncapicitated Facility Location Problem

    G. Cornuejols;G. Nemhauser;L. Wolsey

  • Vertex Packings: Structural Properties and Algorithms.

    George L. Nemhauser;Leslie E. Trotter

  • The Traveling Salesman Problem: A Survey

    Mandell Bellmore;George L. Nemhauser

  • Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”

    Gerard Cornuejols;Marshall L. Fisher;George L. Nemhauser

  • Best Algorithms for Approximating the Maximum of a Submodular Set Function

    G. L. Nemhauser;L. A. Wolsey

  • The uncapacitated facility location problem

    Gerard Cornuejols;George L Nemhauser;Lairemce A Wolsey

  • The fleet assignment problem: Solving a large-scale integer program

    Christopher A. Hane;Cynthia Barnhart;Ellis L. Johnson;Roy E. Marsten

  • The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

    Bram Verweij;Shabbir Ahmed;Anton J. Kleywegt;George Nemhauser

  • Flight String Models for Aircraft Fleeting and Routing

    Cynthia Barnhart;Natashia L. Boland;Lloyd W. Clarke;Ellis L. Johnson

  • Modeling disjunctive constraints with a logarithmic number of binary variables and constraints

    Juan Pablo Vielma;George L. Nemhauser

  • 50 Years of Integer Programming 1958-2008

    Michael Jünger;Thomas M. Liebling;Denis Naddef;George L. Nemhauser

Frequent Co-Authors

Martin W. P. Savelsbergh
Martin W. P. Savelsbergh Georgia Institute of Technology
Shabbir Ahmed
Shabbir Ahmed Georgia Institute of Technology
Ellis L. Johnson
Ellis L. Johnson Georgia Institute of Technology
Laurence A. Wolsey
Laurence A. Wolsey Université Catholique de Louvain
Diego Klabjan
Diego Klabjan Northwestern University
Andrew J. Schaefer
Andrew J. Schaefer Rice University
Marshall L. Fisher
Marshall L. Fisher University of Pennsylvania
Yongpei Guan
Yongpei Guan University of Florida
Natashia Boland
Natashia Boland Georgia Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can enhance career opportunities and provide specialized skills. Many professionals combine mathematical expertise with business or finance, making programs like the cheapest dba online appealing for those interested in data-driven decision making and leadership roles.

If a focus on financial analytics or quantitative finance interests you, earning a degree such as the cheapest masters in finance can provide the necessary financial modeling and risk assessment skills sought after in banking and investment sectors.

For those aspiring to blend math proficiency with business strategy, pursuing the shortest online mba offers an efficient way to gain essential management skills alongside analytical capabilities, preparing graduates for leadership positions across industries.

Marketing professionals with strong quantitative skills may also consider the cheapest online marketing degree, blending market analysis with data science to drive strategic campaigns and business growth.

Best Scientists Citing George L. Nemhauser

Trending Scientists

Recently Published Articles