Follow
George Nemhauser
George Nemhauser
Verified email at isye.gatech.edu
Title
Cited by
Cited by
Year
Integer and Combinatorial Optimization
WL Nemhauser George
12331*1988
Integer and Combinatorial Optimization
WL Nemhauser George
11981*1988
An analysis of approximations for maximizing submodular set functions—I
GL Nemhauser, LA Wolsey, ML Fisher
Mathematical programming 14, 265-294, 1978
50251978
Branch-and-price: Column generation for solving huge integer programs
C Barnhart, EL Johnson, GL Nemhauser, MWP Savelsbergh, PH Vance
Operations research 46 (3), 316-329, 1998
32381998
Integer programming
BM Garfinkel, GL Nemhauser
(No Title), 1972
22171972
Exceptional paper—location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
G Cornuejols, ML Fisher, GL Nemhauser
Management science 23 (8), 789-810, 1977
12791977
Introduction to dynamic programming
GL Nemhauser
(No Title), 1966
11291966
A model and an algorithm for the dynamic traffic assignment problems
DK Merchant, GL Nemhauser
Transportation science 12 (3), 183-199, 1978
9761978
The traveling salesman problem: a survey
M Bellmore, GL Nemhauser
Operations Research 16 (3), 538-558, 1968
9181968
An analysis of approximations for maximizing submodular set functions—II
ML Fisher, GL Nemhauser, LA Wolsey
Polyhedral Combinatorics: Dedicated to the memory of DR Fulkerson, 73-87, 1978
9141978
The uncapicitated facility location problem
G Cornuéjols, G Nemhauser, L Wolsey
Cornell University Operations Research and Industrial Engineering, 1983
8821983
Vertex packings: structural properties and algorithms
GL Nemhauser, LE Trotter Jr
Mathematical Programming 8 (1), 232-248, 1975
8271975
50 Years of integer programming 1958-2008: From the early years to the state-of-the-art
M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ...
Springer Science & Business Media, 2009
805*2009
Best algorithms for approximating the maximum of a submodular set function
GL Nemhauser, LA Wolsey
Mathematics of operations research 3 (3), 177-188, 1978
6791978
The fleet assignment problem: Solving a large-scale integer program
CA Hane, C Barnhart, EL Johnson, RE Marsten, GL Nemhauser, ...
Mathematical Programming 70, 211-232, 1995
6481995
The sample average approximation method applied to stochastic routing problems: a computational study
B Verweij, S Ahmed, AJ Kleywegt, G Nemhauser, A Shapiro
Computational optimization and applications 24, 289-333, 2003
6002003
Flight string models for aircraft fleeting and routing
C Barnhart, NL Boland, LW Clarke, EL Johnson, GL Nemhauser, ...
Transportation science 32 (3), 208-220, 1998
5191998
Optimality conditions for a dynamic traffic assignment model
DK Merchant, GL Nemhauser
Transportation Science 12 (3), 200-207, 1978
4971978
Optimal political districting by implicit enumeration techniques
RS Garfinkel, GL Nemhauser
Management Science 16 (8), B-495-B-508, 1970
4601970
An algorithm for the line balancing problem
AL Gutjahr, GL Nemhauser
Management science 11 (2), 308-315, 1964
4351964
The system can't perform the operation now. Try again later.
Articles 1–20