George L. Nemhauser
Active 1964–2026
- 198
- Papers
- 35,007
- Citations
- 69
- h-index
- 158
- i10-index
Citations
Citation sources
Countries
Institutions
Fields
- Computer Science36%
- Engineering34%
- Decision Sciences7.9%
- Business, Management and Accounting7.5%
- Physics and Astronomy4.1%
- Mathematics3.6%
- Other6.9%
Topics
- Vehicle Routing Optimization Methods7.5%
- Complexity and Algorithms in Graphs4%
- Optimization and Search Problems3.9%
- Optimization and Packing Problems3.6%
- Advanced Graph Theory Research2.7%
- Scheduling and Optimization Algorithms2.7%
- Other75.6%
Coauthors
- Martin W. P. Savelsbergh36
- Shabbir Ahmed30
- Ellis L. Johnson25
- Laurence A. Wolsey10
- Cynthia Barnhart8
- Diego Klabjan7
- Gérard Cornuéjols7
- Joel S. Sokol7
- Ahmet B. Keha6
- Andrew J. Miller6
- Ismael R. de Farias Jr.6
- Juan Pablo Vielma6
- Marshall L. Fisher6
- Pamela H. Vance6
- Yufen Shao6
- Zonghao Gu6
- Dimitri J. Papageorgiou5
- Mike Hewitt5
- Natashia Boland5
- Pierre Le Bodic5
- Alejandro Toriello4
- Alper Atamtürk4
- Andrew J. Schaefer4
- Anton J. Kleywegt4
All papers
- An analysis of approximations for maximizing submodular set functions - I
Authors: George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher - Mathematical Programming, Math. Program. 1978 cited by 4,458
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
Authors: Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, Pamela H. Vance - Operations Research, Oper. Res. 1998 cited by 2,189
- Integer and Combinatorial Optimization
Authors: George L. Nemhauser, Laurence A. Wolsey - DAGLIB 1988 cited by 3,134
- Learning to Branch in Mixed Integer Programming
Authors: Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina - AAAI Conference on Artificial Intelligence 2016 cited by 309
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
Authors: George L. Nemhauser, Laurence A. Wolsey - LIDAM Reprints CORE, Math. Oper. Res. 1978 cited by 556
- The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study
Authors: Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George L. Nemhauser, Alexander Shapiro - Computational Optimization and Applications, Comput. Optim. Appl. 2003 cited by 483
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
Authors: James R. Luedtke, Shabbir Ahmed, George L. Nemhauser - Lecture notes in computer science, IPCO 2007 cited by 345
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
Authors: Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser - Operations Research, Oper. Res. 2009 cited by 360
- Handbooks in operations research and management science
Authors: George L. Nemhauser, A. H. G. Rinnooy Kan - Elsevier eBooks 1989 cited by 2,414
- Easy and hard bottleneck location problems
Authors: Wen-Lian Hsu, George L. Nemhauser - Discrete Applied Mathematics, Discret. Appl. Math. 1979 cited by 215
- On the Uncapacitated Location Problem
Authors: Gérard Cornuéjols, Marshall L. Fisher, George L. Nemhauser - Annals of discrete mathematics 1977 cited by 147
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Authors: Gérard Cornuéjols, Marshall L. Fisher, George L. Nemhauser - Management Science 1977 cited by 802
- Integer and Combinatorial Optimization
Authors: H. P. Williams, George L. Nemhauser, Laurence A. Wolsey - Journal of the Operational Research Society 1990 cited by 5,565
- Flight String Models for Aircraft Fleeting and Routing
Authors: Cynthia Barnhart, Natashia L. Boland, Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Rajesh G. Shenoi - Transportation Science, Transp. Sci. 1998 cited by 365
- The Traveling Tournament Problem Description and Benchmarks
Authors: Kelly Easton, George L. Nemhauser, Michael A. Trick - Lecture notes in computer science, CP 2001 cited by 224
- Learning to Run Heuristics in Tree Search
Authors: Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao - Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017 cited by 114
- Congestion-aware dynamic routing in automated material handling systems
Authors: Kelly Bartlett, Junho Lee, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol, Byungsoo Na - Computers & Industrial Engineering, Comput. Ind. Eng. 2014 cited by 69
- An Optimization Based Heuristic for Political Districting
Authors: Anuj Mehrotra, Ellis L. Johnson, George L. Nemhauser - Management Science 1998 cited by 253
- Min-cut clustering
Authors: Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser - Mathematical Programming, Math. Program. 1993 cited by 224
- Models for representing piecewise linear cost functions
Authors: Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser - Operations Research Letters, Oper. Res. Lett. 2003 cited by 158
- Scheduling A Major College Basketball Conference
Authors: George L. Nemhauser, Michael A. Trick - Operations Research, Oper. Res. 1998 cited by 261
- Solving binary cutting stock problems by column generation and branch-and-bound
Authors: Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser - Computational Optimization and Applications, Comput. Optim. Appl. 1994 cited by 222
- The aircraft rotation problem
Authors: Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Zhongxi Zhu - Annals of Operations Research, Ann. Oper. Res. 1997 cited by 211
- Conflict graphs in solving integer programming problems
Authors: Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh - European Journal of Operational Research, Eur. J. Oper. Res. 2000 cited by 158
