George Nemhauser

George Nemhauser

Georgia Institute of Technology

H-index: 87

North America-United States

About George Nemhauser

George Nemhauser, With an exceptional h-index of 87 and a recent h-index of 45 (since 2020), a distinguished researcher at Georgia Institute of Technology, specializes in the field of operations research.

His recent articles reflect a diverse array of research interests and contributions to the field:

Learning to Branch with Interpretable Machine Learning Models

An exact algorithm for the service network design problem with hub capacity constraints

Decomposition of loosely coupled integer programs: a multiobjective perspective

Dynamic discretization discovery algorithms for time-dependent shortest path problems

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems

Time-dependent shortest path problems with penalties and limits on waiting

Decentralized online integer programming problems with a coupling cardinality constraint

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint

George Nemhauser Information

University

Position

Professor

Citations(all)

54410

Citations(since 2020)

11889

Cited By

48822

hIndex(all)

87

hIndex(since 2020)

45

i10Index(all)

225

i10Index(since 2020)

124

Email

University Profile Page

Georgia Institute of Technology

Google Scholar

View Google Scholar Profile

George Nemhauser Skills & Research Interests

operations research

Top articles of George Nemhauser

Title

Journal

Author(s)

Publication Date

Learning to Branch with Interpretable Machine Learning Models

Selin Bayramoglu

George Nemhauser

Nick Sahinidis

2023/10/15

An exact algorithm for the service network design problem with hub capacity constraints

Networks

Edward He

Natashia Boland

George Nemhauser

Martin Savelsbergh

2022/12

Decomposition of loosely coupled integer programs: a multiobjective perspective

Mathematical Programming

Merve Bodur

Shabbir Ahmed

Natashia Boland

George L Nemhauser

2022/11

Dynamic discretization discovery algorithms for time-dependent shortest path problems

INFORMS Journal on Computing

Edward Yuhang He

Natashia Boland

George Nemhauser

Martin Savelsbergh

2022/3

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems

INFORMS Journal on Computing

Hossein Hashemi Doulabi

Shabbir Ahmed

George Nemhauser

2022/1

Time-dependent shortest path problems with penalties and limits on waiting

INFORMS Journal on Computing

Edward He

Natashia Boland

George Nemhauser

Martin Savelsbergh

2021/7

Decentralized online integer programming problems with a coupling cardinality constraint

Computers & Operations Research

Ezgi Karabulut

Shabbir Ahmed

George Nemhauser

2021/11/1

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint

Discrete Optimization

Ezgi Karabulut

Shabbir Ahmed

George Nemhauser

2020/11/1

A linear programming based approach to the Steiner tree problem with a fixed number of terminals

Networks

Matias Siebert

Shabbir Ahmed

George Nemhauser

2020/3

A simulated annealing algorithm for the directed Steiner tree problem

arXiv preprint arXiv:2002.03055

Matias Siebert

Shabbir Ahmed

George Nemhauser

2020/2/8

See List of Professors in George Nemhauser University(Georgia Institute of Technology)

Co-Authors

H-index: 84
Martin Savelsbergh

Martin Savelsbergh

Georgia Institute of Technology

H-index: 71
Laurence Wolsey,

Laurence Wolsey,

Université Catholique de Louvain

H-index: 64
Ellis L Johnson

Ellis L Johnson

Georgia Institute of Technology

H-index: 59
marshall fisher

marshall fisher

University of Pennsylvania

H-index: 51
Shabbir Ahmed

Shabbir Ahmed

Georgia Institute of Technology

H-index: 43
Alper Atamturk

Alper Atamturk

University of California, Berkeley

academic-engine