Suivre
George Nemhauser
George Nemhauser
Adresse e-mail validée de isye.gatech.edu
Titre
Citée par
Citée par
Année
Integer and Combinatorial Optimization
WL Nemhauser George
11394*1988
Integer and Combinatorial Optimization
WL Nemhauser George
11326*1988
An analysis of approximations for maximizing submodular set functions—I
GL Nemhauser, LA Wolsey, ML Fisher
Mathematical programming 14 (1), 265-294, 1978
43931978
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
29821998
Integer programming
RS Garfinkel
20731972
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
12241977
Introduction to dynamic programming
GL Nemhauser
Wiley, 1966
10641966
A model and an algorithm for the dynamic traffic assignment problems
DK Merchant, GL Nemhauser
Transportation science 12 (3), 183-199, 1978
9181978
The traveling salesman problem: a survey
M Bellmore, GL Nemhauser
Operations Research 16 (3), 538-558, 1968
8211968
The uncapicitated facility location problem
G Cornuéjols, G Nemhauser, L Wolsey
Cornell University Operations Research and Industrial Engineering, 1983
8081983
An analysis of approximations for maximizing submodular set functions—II
ML Fisher, GL Nemhauser, LA Wolsey
Polyhedral combinatorics, 73-87, 1978
7901978
Vertex packings: structural properties and algorithms
GL Nemhauser, LE Trotter
Mathematical Programming 8 (1), 232-248, 1975
7851975
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
773*2009
The fleet assignment problem: Solving a large-scale integer program
CA Hane, C Barnhart, EL Johnson, RE Marsten, GL Nemhauser, ...
Mathematical Programming 70 (1), 211-232, 1995
6021995
Best algorithms for approximating the maximum of a submodular set function
GL Nemhauser, LA Wolsey
Mathematics of operations research 3 (3), 177-188, 1978
5801978
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 (2), 289-333, 2003
5232003
Optimality conditions for a dynamic traffic assignment model
DK Merchant, GL Nemhauser
Transportation Science 12 (3), 200-207, 1978
4751978
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
4661998
Optimal political districting by implicit enumeration techniques
RS Garfinkel, GL Nemhauser
Management Science 16 (8), B-495-B-508, 1970
4331970
An algorithm for the line balancing problem
AL Gutjahr, GL Nemhauser
Management science 11 (2), 308-315, 1964
4131964
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20