dblp.uni-trier.dewww.uni-trier.de

George L. Nemhauser Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
60EEFatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh: Approximating the stability region for binary mixed-integer programs. Oper. Res. Lett. 37(4): 250-254 (2009)
59EEYongpei Guan, Shabbir Ahmed, George L. Nemhauser: Cutting Planes for Multistage Stochastic Integer Programs. Operations Research 57(2): 287-298 (2009)
2008
58EEJuan Pablo Vielma, George L. Nemhauser: Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO 2008: 199-213
57EEJill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh: Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. Discrete Optimization 5(1): 19-35 (2008)
56EEMartin Grötschel, George L. Nemhauser: George Dantzig's contributions to integer programming. Discrete Optimization 5(2): 168-173 (2008)
55EEJuan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser: Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optimization 5(2): 467-488 (2008)
54EEJuan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser: A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. INFORMS Journal on Computing 20(3): 438-450 (2008)
53EEDaniel Espinoza, R. Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh: Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. Transportation Science 42(3): 263-278 (2008)
52EEDaniel Espinoza, R. Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh: Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transportation Science 42(3): 279-291 (2008)
2007
51EEJames Luedtke, Shabbir Ahmed, George L. Nemhauser: An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423
50EEGeorge L. Nemhauser: Hooked on IP. Annals OR 149(1): 157-161 (2007)
49EEJill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh: Analysis of bounds for a capacitated single-item lot-sizing problem. Computers & OR 34(6): 1721-1743 (2007)
48EEYongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential pairing of mixed integer inequalities. Discrete Optimization 4(1): 21-39 (2007)
2006
47EEAndrew J. Schaefer, George L. Nemhauser: Improving airline operational performance through schedule perturbation. Annals OR 144(1): 3-16 (2006)
46EEEk Peng Chew, Huei Chuen Huang, Ellis L. Johnson, George L. Nemhauser, Joel S. Sokol, Chun How Leong: Short-term booking of air cargo space. European Journal of Operational Research 174(3): 1979-1990 (2006)
45EEYongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Program. 105(1): 55-84 (2006)
44EEYongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser: On formulations of the stochastic uncapacitated lot-sizing problem. Oper. Res. Lett. 34(3): 241-250 (2006)
43EEAhmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. Operations Research 54(5): 847-858 (2006)
2005
42EEYongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential Pairing of Mixed Integer Inequalities. IPCO 2005: 23-34
41EEDieter Vandenbussche, George L. Nemhauser: The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005)
40EEDieter Vandenbussche, George L. Nemhauser: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005)
39EEDieter Vandenbussche, George L. Nemhauser: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559-575 (2005)
38EEAndrew J. Schaefer, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser: Airline Crew Scheduling Under Uncertainty. Transportation Science 39(3): 340-348 (2005)
2004
37 George L. Nemhauser, Daniel Bienstock: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings Springer 2004
36EEAhmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32(1): 44-48 (2004)
35EEJay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser: A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles. Transportation Science 38(3): 357-368 (2004)
2003
34EEAndrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. Math. Program. 95(1): 71-90 (2003)
33EEIsmael R. de Farias Jr., George L. Nemhauser: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003)
32EEJay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser: Rerouting Aircraft for Airline Recovery. Transportation Science 37(4): 408-421 (2003)
2002
31EEJean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser: Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. IPCO 2002: 161-175
30EEIsmael R. de Farias Jr., George L. Nemhauser: A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303
29EEKelly Easton, George L. Nemhauser, Michael A. Trick: Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. PATAT 2002: 100-112
28EEJeff Day, George L. Nemhauser, Joel S. Sokol: Management of Railroad Impedances for Shortest Path-based Routing. Electr. Notes Theor. Comput. Sci. 66(6): (2002)
27EEIsmael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser: Facets of the Complementarity Knapsack Polytope. Math. Oper. Res. 27(1): 210-226 (2002)
26EEDiego Klabjan, George L. Nemhauser: A Polyhedral Study of Integer Variable Upper Bounds. Math. Oper. Res. 27(4): 711-739 (2002)
25EEDiego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy: Airline Crew Scheduling with Time Windows and Plane-Count Constraints. Transportation Science 36(3): 337-348 (2002)
24EEJay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser: A Stochastic Model of Airline Operations. Transportation Science 36(4): 357-377 (2002)
2001
23EEKelly Easton, George L. Nemhauser, Michael A. Trick: The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584
22EEJean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser: A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. Combinatorial Optimization 2001: 158-170
21EEAndrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh: Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. IPCO 2001: 318-332
20EEIsmael R. de Farias Jr., George L. Nemhauser: A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. 29(2): 49-55 (2001)
19EEDiego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy: Airline Crew Scheduling with Regularity. Transportation Science 35(4): 359-374 (2001)
2000
18EEJay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser: Air transportation simulation: SimAir: a stochastic model of airline operations. Winter Simulation Conference 2000: 1118-1122
17EEEllis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS Journal on Computing 12(1): 2-23 (2000)
16 Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Sequence Independent Lifting in Mixed Integer Programming. J. Comb. Optim. 4(1): 109-129 (2000)
15EEDiego Klabjan, Ellis L. Johnson, George L. Nemhauser: A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2): 47-55 (2000)
14EELadislav Lettovsky, Ellis L. Johnson, George L. Nemhauser: Airline Crew Recovery. Transportation Science 34(4): 337-348 (2000)
1999
13EEAlper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh: Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72
12EEZonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. INFORMS Journal on Computing 11(1): 117-123 (1999)
1998
11EEDasong Cao, George L. Nemhauser: Polyhedral Characterizations, Perfection of Line Graphs. Discrete Applied Mathematics 81(1-3): 141-154 (1998)
10EEZonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Lifted Cover Inequalities for 0-1 Integer Programs: Computation. INFORMS Journal on Computing 10(4): 427-437 (1998)
9EEDiego Klabjan, George L. Nemhauser, C. Tovey: The complexity of cover inequality separation. Oper. Res. Lett. 23(1-2): 35-40 (1998)
8EECynthia Barnhart, Natashia L. Boland, Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Rajesh G. Shenoi: Flight String Models for Aircraft Fleeting and Routing. Transportation Science 32(3): 208-220 (1998)
1996
7 George L. Nemhauser: Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). CP 1996: 570
1995
6EEZonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Sequence Independent Lifting of Cover Inequalities. IPCO 1995: 452-461
1993
5 Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser: Min-cut clustering. Math. Program. 62: 133-151 (1993)
1992
4 Ellis L. Johnson, George L. Nemhauser: Recent Developments and Future Directions in Mathematical Programming. IBM Systems Journal 31(1): 79-93 (1992)
1990
3 George L. Nemhauser, Laurence A. Wolsey: A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. Math. Program. 46: 379-390 (1990)
1982
2EEWen-Lian Hsu, George L. Nemhauser: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. Discrete Mathematics 38(1): 65-71 (1982)
1981
1EEWen-Lian Hsu, George L. Nemhauser: Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. Discrete Mathematics 37(2-3): 181-191 (1981)

Coauthor Index

1Shabbir Ahmed [42] [44] [45] [48] [51] [54] [59] [60]
2Alper Atamtürk [13]
3Cynthia Barnhart [8]
4Daniel Bienstock [37]
5Natashia L. Boland [8]
6Dasong Cao [11]
7Ek Peng Chew [46]
8Lloyd W. Clarke [8]
9Jeff Day [28]
10Kelly Easton [23] [29]
11Daniel Espinoza [52] [53]
12Ismael R. de Farias Jr. [20] [22] [27] [30] [31] [33] [36] [43]
13R. Garcia [52] [53]
14Eric Gelman [19] [25]
15David Goldsman [18] [24]
16Marcos Goycoolea [52] [53]
17Martin Grötschel [56]
18Zonghao Gu [6] [10] [12] [16]
19Yongpei Guan [42] [44] [45] [48] [59]
20Jill R. Hardin [49] [57]
21Wen-Lian Hsu [1] [2]
22Huei Chuen Huang [46]
23Ellis L. Johnson [4] [5] [8] [14] [15] [17] [18] [19] [24] [25] [27] [32] [35] [38] [46]
24Ahmet B. Keha [36] [43] [55]
25Fatma Kilinç-Karzan [60]
26Diego Klabjan [9] [15] [19] [25] [26]
27Anton J. Kleywegt [18] [24] [38]
28Chun How Leong [46]
29Ladislav Lettovsky [14]
30James Luedtke [51]
31Anuj Mehrotra [5]
32Andrew J. Miller [21] [34] [44] [45]
33Srini Ramaswamy [19] [25]
34Jean-Philippe P. Richard [22] [31]
35Jay M. Rosenberger [18] [24] [32] [35]
36Martin W. P. Savelsbergh [6] [10] [12] [13] [16] [17] [21] [34] [49] [52] [53] [57] [60]
37Andrew J. Schaefer [18] [24] [38] [47]
38Rajesh G. Shenoi [8]
39Joel S. Sokol [28] [46]
40Alejandro Toriello [60]
41C. Tovey [9]
42Michael A. Trick [23] [29]
43Dieter Vandenbussche [39] [40] [41]
44Juan Pablo Vielma [54] [55] [58]
45Laurence A. Wolsey [3]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)