George L. Nemhauser

2008
45	EE	Juan Pablo Vielma, George L. Nemhauser: Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO 2008: 199-213
44	EE	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)
43	EE	Martin Grötschel, George L. Nemhauser: George Dantzig's contributions to integer programming. Discrete Optimization 5(2): 168-173 (2008)
42	EE	Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser: Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optimization 5(2): 467-488 (2008)
41	EE	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)
2007
40	EE	James Luedtke, Shabbir Ahmed, George L. Nemhauser: An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423
39	EE	George L. Nemhauser: Hooked on IP. Annals OR 149(1): 157-161 (2007)
38	EE	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)
37	EE	Yongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential pairing of mixed integer inequalities. Discrete Optimization 4(1): 21-39 (2007)
2006
36	EE	Andrew J. Schaefer, George L. Nemhauser: Improving airline operational performance through schedule perturbation. Annals OR 144(1): 3-16 (2006)
35	EE	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)
34	EE	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)
33	EE	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)
2005
32	EE	Yongpei Guan, Shabbir Ahmed, George L. Nemhauser: Sequential Pairing of Mixed Integer Inequalities. IPCO 2005: 23-34
31	EE	Dieter Vandenbussche, George L. Nemhauser: The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005)
30	EE	Dieter Vandenbussche, George L. Nemhauser: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005)
29	EE	Dieter Vandenbussche, George L. Nemhauser: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559-575 (2005)
2004
28		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
27	EE	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)
2003
26	EE	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)
25	EE	Ismael R. de Farias Jr., George L. Nemhauser: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003)
2002
24	EE	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
23	EE	Ismael R. de Farias Jr., George L. Nemhauser: A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303
22	EE	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
21	EE	Jeff Day, George L. Nemhauser, Joel S. Sokol: Management of Railroad Impedances for Shortest Path-based Routing. Electr. Notes Theor. Comput. Sci. 66(6): (2002)
20	EE	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)
19	EE	Diego Klabjan, George L. Nemhauser: A Polyhedral Study of Integer Variable Upper Bounds. Math. Oper. Res. 27(4): 711-739 (2002)
2001
18	EE	Kelly Easton, George L. Nemhauser, Michael A. Trick: The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584
17	EE	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
16	EE	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
15	EE	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)
2000
14	EE	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
13	EE	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)
12		Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh: Sequence Independent Lifting in Mixed Integer Programming. J. Comb. Optim. 4(1): 109-129 (2000)
11	EE	Diego Klabjan, Ellis L. Johnson, George L. Nemhauser: A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2): 47-55 (2000)
1999
10	EE	Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh: Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72
1998
9	EE	Dasong Cao, George L. Nemhauser: Polyhedral Characterizations, Perfection of Line Graphs. Discrete Applied Mathematics 81(1-3): 141-154 (1998)
8	EE	Diego Klabjan, George L. Nemhauser, C. Tovey: The complexity of cover inequality separation. Oper. Res. Lett. 23(1-2): 35-40 (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
6		Zonghao 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
2	EE	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	EE	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	[32] [33] [34] [37] [40] [41]
2	Alper Atamtürk	[10]
3	Daniel Bienstock	[28]
4	Dasong Cao	[9]
5	Ek Peng Chew	[35]
6	Jeff Day	[21]
7	Kelly Easton	[18] [22]
8	Ismael R. de Farias Jr.	[15] [17] [20] [23] [24] [25] [27]
9	David Goldsman	[14]
10	Martin Grötschel	[43]
11	Zonghao Gu	[6] [12]
12	Yongpei Guan	[32] [33] [34] [37]
13	Jill R. Hardin	[38] [44]
14	Wen-Lian Hsu	[1] [2]
15	Huei Chuen Huang	[35]
16	Ellis L. Johnson	[4] [5] [11] [13] [14] [20] [35]
17	Ahmet B. Keha	[27] [42]
18	Diego Klabjan	[8] [11] [19]
19	Anton J. Kleywegt	[14]
20	Chun How Leong	[35]
21	James Luedtke	[40]
22	Anuj Mehrotra	[5]
23	Andrew J. Miller	[16] [26] [33] [34]
24	Jean-Philippe P. Richard	[17] [24]
25	Jay M. Rosenberger	[14]
26	Martin W. P. Savelsbergh	[6] [10] [12] [13] [16] [26] [38] [44]
27	Andrew J. Schaefer	[14] [36]
28	Joel S. Sokol	[21] [35]
29	C. Tovey	[8]
30	Michael A. Trick	[18] [22]
31	Dieter Vandenbussche	[29] [30] [31]
32	Juan Pablo Vielma	[41] [42] [45]
33	Laurence A. Wolsey	[3]

Colors in the list of coauthors