Integer and Combinatorial Optimization WL Nemhauser George | 12413* | 1988 |
An analysis of approximations for maximizing submodular set functions—I GL Nemhauser, LA Wolsey, ML Fisher Mathematical programming 14, 265-294, 1978 | 5170 | 1978 |
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 | 3266 | 1998 |
Integer programming RS Garfinkel New York: Wiley,, 1972 | 2158 | 1972 |
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 | 1291 | 1977 |
Introduction to dynamic programming GL Nemhauser Wiley, 1967 | 1141 | 1967 |
A model and an algorithm for the dynamic traffic assignment problems DK Merchant, GL Nemhauser Transportation science 12 (3), 183-199, 1978 | 984 | 1978 |
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 | 932 | 1978 |
The traveling salesman problem: a survey M Bellmore, GL Nemhauser Operations Research 16 (3), 538-558, 1968 | 932 | 1968 |
The uncapicitated facility location problem G Cornuéjols, G Nemhauser, L Wolsey Cornell University Operations Research and Industrial Engineering, 1983 | 917 | 1983 |
Vertex packings: structural properties and algorithms GL Nemhauser, LE Trotter Jr Mathematical Programming 8 (1), 232-248, 1975 | 838 | 1975 |
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 | 822* | 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 | 693 | 1978 |
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 | 654 | 1995 |
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 | 614 | 2003 |
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 | 525 | 1998 |
Optimality conditions for a dynamic traffic assignment model DK Merchant, GL Nemhauser Transportation Science 12 (3), 200-207, 1978 | 500 | 1978 |
Optimization GL Nemhauser, AHGR Kan, MJ Todd Elsevier North-Holland, Inc., 1989 | 483 | 1989 |
Optimal political districting by implicit enumeration techniques RS Garfinkel, GL Nemhauser Management Science 16 (8), B-495-B-508, 1970 | 459 | 1970 |
An algorithm for the line balancing problem AL Gutjahr, GL Nemhauser Management science 11 (2), 308-315, 1964 | 447 | 1964 |