George L. Nemhauser

	2012
81		Alejandro Toriello, George L. Nemhauser: The value function of an infinite-horizon single-item lot-sizing problem. Oper. Res. Lett. 40(1): 12-14 (2012)
80		Qie He, Shabbir Ahmed, George L. Nemhauser: Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. Oper. Res. Lett. 40(2): 69-73 (2012)
79		Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser: Mixed integer linear programming formulations for probabilistic constraints. Oper. Res. Lett. 40(3): 153-158 (2012)
	2011
78		Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh: Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem. INFORMS Journal on Computing 23(1): 105-119 (2011)
77		Juan Pablo Vielma, George L. Nemhauser: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1-2): 49-72 (2011)
76		Qie He, Shabbir Ahmed, George L. Nemhauser: A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. SIAM Journal on Optimization 21(3): 617-632 (2011)
	2010
75		William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes: Automated Channel Abstraction for Advertising Auctions. AAAI 2010
74		Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. INFORMS Journal on Computing 22(2): 314-325 (2010)
73		Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser: A Note on "A Superior Representation Method for Piecewise Linear Functions". INFORMS Journal on Computing 22(3): 493-497 (2010)
72		James Luedtke, Shabbir Ahmed, George L. Nemhauser: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2): 247-272 (2010)
71		Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. Operations Research 58(2): 303-315 (2010)
70		Gizem Keysan, George L. Nemhauser, Martin W. P. Savelsbergh: Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation. Transportation Science 44(3): 291-306 (2010)
	2009
69		Fatma 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)
68		Yongpei Guan, Shabbir Ahmed, George L. Nemhauser: Cutting Planes for Multistage Stochastic Integer Programs. Operations Research 57(2): 287-298 (2009)
67		James Luedtke, George L. Nemhauser: Strategic Planning with Start-Time Dependent Variable Costs. Operations Research 57(5): 1250-1261 (2009)
	2008
66		Juan Pablo Vielma, George L. Nemhauser: Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO 2008: 199-213
65		Jill 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)
64		Martin Grötschel, George L. Nemhauser: George Dantzig's contributions to integer programming. Discrete Optimization 5(2): 168-173 (2008)
63		Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser: Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optimization 5(2): 467-488 (2008)
62		Juan 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)
61		Daniel G. 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)
60		Daniel G. 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
59		James Luedtke, Shabbir Ahmed, George L. Nemhauser: An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423
58		George L. Nemhauser: Hooked on IP. Annals OR 149(1): 157-161 (2007)
57		Jill 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)
56		Yongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential pairing of mixed integer inequalities. Discrete Optimization 4(1): 21-39 (2007)
	2006
55		Andrew J. Schaefer, George L. Nemhauser: Improving airline operational performance through schedule perturbation. Annals OR 144(1): 3-16 (2006)
54		Ek 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)
53		Yongpei 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)
52		Yongpei 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)
51		Ahmet 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
50		Yongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential Pairing of Mixed Integer Inequalities. IPCO 2005: 23-34
49		Dieter Vandenbussche, George L. Nemhauser: The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005)
48		Dieter Vandenbussche, George L. Nemhauser: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005)
47		Dieter Vandenbussche, George L. Nemhauser: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559-575 (2005)
46		Andrew J. Schaefer, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser: Airline Crew Scheduling Under Uncertainty. Transportation Science 39(3): 340-348 (2005)
	2004
45		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
44		Ahmet 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)
43		Jay 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
42		Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh: On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94(2-3): 375-405 (2003)
41		Andrew 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)
40		Ismael R. de Farias Jr., George L. Nemhauser: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003)
39		Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser: Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Math. Program. 98(1-3): 115-143 (2003)
38		Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Math. Program. 98(1-3): 89-113 (2003)
37		Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser: Rerouting Aircraft for Airline Recovery. Transportation Science 37(4): 408-421 (2003)
	2002
36		Jean-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
35		Ismael R. de Farias Jr., George L. Nemhauser: A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303
34		Kelly Easton, George L. Nemhauser, Michael A. Trick: Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. PATAT 2002: 100-112
33		Jeff Day, George L. Nemhauser, Joel S. Sokol: Management of Railroad Impedances for Shortest Path-based Routing. Electr. Notes Theor. Comput. Sci. 66(6): 53-65 (2002)
32		Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser: Facets of the Complementarity Knapsack Polytope. Math. Oper. Res. 27(1): 210-226 (2002)
31		Diego Klabjan, George L. Nemhauser: A Polyhedral Study of Integer Variable Upper Bounds. Math. Oper. Res. 27(4): 711-739 (2002)
30		Diego 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)
29		Jay 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
28		Kelly Easton, George L. Nemhauser, Michael A. Trick: The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584
27		Jean-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
26		Andrew 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
25		Ismael R. de Farias Jr., George L. Nemhauser: A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. 29(2): 49-55 (2001)
24		Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy: Airline Crew Scheduling with Regularity. Transportation Science 35(4): 359-374 (2001)
	2000
23		Jay 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
22		Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh: Conflict graphs in solving integer programming problems. European Journal of Operational Research 121(1): 40-55 (2000)
21		Natashia L. Boland, Lloyd W. Clarke, George L. Nemhauser: The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operational Research 123(2): 408-427 (2000)
20		Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. European Journal of Operational Research 125(2): 298-315 (2000)
19		Ellis 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)
18		Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Sequence Independent Lifting in Mixed Integer Programming. J. Comb. Optim. 4(1): 109-129 (2000)
17		Diego Klabjan, Ellis L. Johnson, George L. Nemhauser: A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2): 47-55 (2000)
16		Ladislav Lettovsky, Ellis L. Johnson, George L. Nemhauser: Airline Crew Recovery. Transportation Science 34(4): 337-348 (2000)
	1999
15		Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh: Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72
14		Zonghao 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
13		Dasong Cao, George L. Nemhauser: Polyhedral Characterizations, Perfection of Line Graphs. Discrete Applied Mathematics 81(1-3): 141-154 (1998)
12		Zonghao 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)
11		Diego Klabjan, George L. Nemhauser, Craig A. Tovey: The complexity of cover inequality separation. Oper. Res. Lett. 23(1-2): 35-40 (1998)
10		Cynthia 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
9		George L. Nemhauser: Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). CP 1996: 570
8		Lloyd W. Clarke, Christopher A. Hane, Ellis L. Johnson, George L. Nemhauser: Maintenance and Crew Considerations in Fleet Assignment. Transportation Science 30(3): 249-260 (1996)
	1995
7		Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Sequence Independent Lifting of Cover Inequalities. IPCO 1995: 452-461
	1993
6		Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser: Min-cut clustering. Math. Program. 62: 133-151 (1993)
	1992
5		Ellis L. Johnson, George L. Nemhauser: Recent Developments and Future Directions in Mathematical Programming. IBM Systems Journal 31(1): 79-93 (1992)
	1990
4		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)
	1988
3		George L. Nemhauser, Laurence A. Wolsey: Integer and combinatorial optimization. Wiley 1988: I-XIV, 1-763
	1982
2		Wen-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
1		Wen-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

1	Shabbir Ahmed	[50] [52] [53] [56] [59] [62] [68] [69] [71] [72] [73] [76] [79] [80]
2	Alper Atamtürk	[15] [22]
3	Cynthia Barnhart	[10]
4	Daniel Bienstock	[45]
5	Natashia L. Boland	[10] [21]
6	Craig Boutilier	[75]
7	Dasong Cao	[13]
8	Ek Peng Chew	[54]
9	Lloyd W. Clarke	[8] [10] [21]
10	Jeff Day	[33]
11	Kelly Easton	[28] [34]
12	Faramroze G. Engineer	[78]
13	Daniel G. Espinoza	[60] [61]
14	Ismael R. de Farias Jr. (Ismael Regis de Farias Jr.)	[25] [27] [32] [35] [36] [38] [39] [40] [44] [51]
15	R. Garcia	[60] [61]
16	Eric Gelman	[24] [30]
17	David Goldsman	[23] [29]
18	Marcos Goycoolea	[60] [61]
19	Martin Grötschel	[64]
20	Zonghao Gu	[7] [12] [14] [18]
21	Yongpei Guan	[50] [52] [53] [56] [68]
22	Christopher A. Hane	[8]
23	Jill R. Hardin	[57] [65]
24	Qie He	[76] [80]
25	Mike Hewitt	[74]
26	Wen-Lian Hsu	[1] [2]
27	Huei Chuen Huang	[54]
28	Ellis L. Johnson	[5] [6] [8] [10] [16] [17] [19] [23] [24] [29] [30] [32] [37] [43] [46] [54]
29	Ahmet B. Keha	[44] [51] [63]
30	Gizem Keysan	[70]
31	Fatma Kilinç-Karzan	[69]
32	Diego Klabjan	[11] [17] [24] [30] [31]
33	Anton J. Kleywegt	[23] [29] [46]
34	Chun How Leong	[54]
35	Ladislav Lettovsky	[16]
36	James Luedtke	[59] [67] [72]
37	Anuj Mehrotra	[6]
38	Andrew J. Miller	[20] [26] [41] [42] [52] [53]
39	David C. Parkes	[75]
40	Srini Ramaswamy	[24] [30]
41	Jean-Philippe P. Richard	[27] [36] [38] [39]
42	Jay M. Rosenberger	[23] [29] [37] [43]
43	Tuomas Sandholm	[75]
44	Martin W. P. Savelsbergh	[7] [12] [14] [15] [18] [19] [20] [22] [26] [41] [42] [57] [60] [61] [65] [69] [70] [74] [78]
45	Andrew J. Schaefer	[23] [29] [46] [55]
46	Rajesh G. Shenoi	[10]
47	Rob Shields	[75]
48	Joel S. Sokol	[33] [54]
49	Alejandro Toriello	[69] [81]
50	Craig A. Tovey	[11]
51	Michael A. Trick	[28] [34]
52	Dieter Vandenbussche	[47] [48] [49]
53	Juan Pablo Vielma	[62] [63] [66] [71] [73] [77] [79]
54	William E. Walsh	[75]
55	Laurence A. Wolsey	[3] [4]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page