default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge L. Nemhauser
Person information
- affiliation: Georgia Institute of Technology, H. Milton Stewart School of Industrial & Systems, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j156]Mohamed El Tonbari
, George L. Nemhauser, Alejandro Toriello:
Distributionally robust disaster relief planning under the Wasserstein set. Comput. Oper. Res. 168: 106689 (2024)- 2022
- [j155]Hossein Hashemi Doulabi, Shabbir Ahmed, George L. Nemhauser:
State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems. INFORMS J. Comput. 34(1): 354-369 (2022) - [j154]Edward Yuhang He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. INFORMS J. Comput. 34(2): 1086-1114 (2022) - [j153]Merve Bodur, Shabbir Ahmed, Natashia Boland, George L. Nemhauser:
Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196(1): 427-477 (2022) - [j152]Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
An exact algorithm for the service network design problem with hub capacity constraints. Networks 80(4): 572-596 (2022) - 2021
- [j151]Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser:
Decentralized online integer programming problems with a coupling cardinality constraint. Comput. Oper. Res. 135: 105421 (2021) - [j150]Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. INFORMS J. Comput. 33(3): 997-1014 (2021) - 2020
- [j149]Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser:
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint. Discret. Optim. 38: 100595 (2020) - [j148]Matías Siebert, Shabbir Ahmed, George L. Nemhauser:
A linear programming based approach to the Steiner tree problem with a fixed number of terminals. Networks 75(2): 124-136 (2020) - [i5]Matías Siebert, Shabbir Ahmed, George L. Nemhauser:
A Simulated Annealing Algorithm for the Directed Steiner Tree Problem. CoRR abs/2002.03055 (2020)
2010 – 2019
- 2019
- [j147]Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou:
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing. Comput. Oper. Res. 111: 21-34 (2019) - 2018
- [j146]Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao:
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. Comput. Optim. Appl. 69(1): 1-24 (2018) - [j145]Chengliang Zhang, George L. Nemhauser, Joel Sokol, Myun-Seok Cheon, Ahmet B. Keha:
Flexible solutions to maritime inventory routing problems with delivery time windows. Comput. Oper. Res. 89: 153-162 (2018) - [j144]Matías Siebert, Kelly Bartlett, Haejoong Kim, Shabbir Ahmed, Junho Lee, Dima Nazzal, George L. Nemhauser, Joel Sokol:
Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation. Int. J. Prod. Res. 56(1-2): 629-641 (2018) - [c20]Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh:
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. CPAIOR 2018: 289-297 - [i4]Matías Siebert, Shabbir Ahmed, George L. Nemhauser:
A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals. CoRR abs/1812.02237 (2018) - 2017
- [j143]Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Vikas Goel, Yufen Shao:
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. Comput. Oper. Res. 77: 44-57 (2017) - [j142]Carlos Eduardo de Andrade, Shabbir Ahmed, George L. Nemhauser, Yufen Shao:
A hybrid primal heuristic for finding feasible solutions to mixed integer programs. Eur. J. Oper. Res. 263(1): 62-71 (2017) - [j141]Pierre Le Bodic, George L. Nemhauser:
An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1-2): 369-405 (2017) - [j140]Pierre Le Bodic, George L. Nemhauser:
Erratum to: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1-2): 407 (2017) - [c19]Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser:
Estimating the size of search trees by sampling with domain knowledge. IJCAI 2017: 473-479 - [c18]Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao:
Learning to Run Heuristics in Tree Search. IJCAI 2017: 659-666 - 2016
- [j139]Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser:
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. SIAM J. Optim. 26(4): 2059-2079 (2016) - [c17]Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina:
Learning to Branch in Mixed Integer Programming. AAAI 2016: 724-731 - [i3]Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser:
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. CoRR abs/1602.08515 (2016) - 2015
- [j138]Qie He, Shabbir Ahmed, George L. Nemhauser:
Minimum concave cost flow over a grid network. Math. Program. 150(1): 79-98 (2015) - [j137]Pierre Le Bodic, George L. Nemhauser:
How important are branching decisions: Fooling MIP solvers. Oper. Res. Lett. 43(3): 273-278 (2015) - [j136]Yaxian Li, Özlem Ergun, George L. Nemhauser:
A dual heuristic for mixed integer programming. Oper. Res. Lett. 43(4): 411-417 (2015) - [j135]Dimitri J. Papageorgiou, Myun-Seok Cheon, George L. Nemhauser, Joel Sokol:
Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems. Transp. Sci. 49(4): 870-885 (2015) - [i2]Pierre Le Bodic, George L. Nemhauser:
An Abstract Model for Branching and its Application to Mixed Integer Programming. CoRR abs/1511.01818 (2015) - 2014
- [j134]Kelly Bartlett, Junho Lee, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol, Byungsoo Na:
Congestion-aware dynamic routing in automated material handling systems. Comput. Ind. Eng. 70: 176-182 (2014) - [j133]Dimitri J. Papageorgiou, George L. Nemhauser, Joel S. Sokol, Myun-Seok Cheon, Ahmet B. Keha:
MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. Eur. J. Oper. Res. 235(2): 350-366 (2014) - [j132]Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol:
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing. INFORMS J. Comput. 26(4): 825-847 (2014) - [j131]Rodolfo Carvajal, Shabbir Ahmed, George L. Nemhauser, Kevin C. Furman, Vikas Goel, Yufen Shao:
Using diversification, communication and parallelism to solve mixed-integer linear programs. Oper. Res. Lett. 42(2): 186-189 (2014) - [j130]Byungsoo Na, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol:
A cutting and scheduling problem in float glass manufacturing. J. Sched. 17(1): 95-107 (2014) - 2013
- [j129]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40(5): 1410-1419 (2013) - [j128]Menal Guzelsoy, George L. Nemhauser, Martin W. P. Savelsbergh:
Restrict-and-relax search for 0-1 mixed-integer programs. EURO J. Comput. Optim. 1(1-2): 201-218 (2013) - [j127]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. INFORMS J. Comput. 25(2): 302-316 (2013) - 2012
- [j126]Yaxian Li, George L. Nemhauser, Martin W. P. Savelsbergh:
Pricing for production and delivery flexibility in single-item lot-sizing. Comput. Oper. Res. 39(12): 3408-3419 (2012) - [j125]Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
The Fixed-Charge Shortest-Path Problem. INFORMS J. Comput. 24(4): 578-596 (2012) - [j124]Faramroze G. Engineer, Kevin C. Furman, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing. Oper. Res. 60(1): 106-122 (2012) - [j123]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) - [j122]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) - [j121]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
Mixed integer linear programming formulations for probabilistic constraints. Oper. Res. Lett. 40(3): 153-158 (2012) - [j120]Dimitri J. Papageorgiou, Alejandro Toriello, George L. Nemhauser, Martin W. P. Savelsbergh:
Fixed-Charge Transportation with Product Blending. Transp. Sci. 46(2): 281-295 (2012) - [c16]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search - (Extended Abstract). ISCO 2012: 15-18 - 2011
- [j119]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 J. Comput. 23(1): 105-119 (2011) - [j118]Amar Kumar Narisetty, Jean-Philippe P. Richard, George L. Nemhauser:
Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study. INFORMS J. Comput. 23(3): 416-424 (2011) - [j117]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) - [j116]Qie He, Shabbir Ahmed, George L. Nemhauser:
A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. SIAM J. Optim. 21(3): 617-632 (2011) - 2010
- [j115]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. INFORMS J. Comput. 22(2): 314-325 (2010) - [j114]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
A Note on "A Superior Representation Method for Piecewise Linear Functions". INFORMS J. Comput. 22(3): 493-497 (2010) - [j113]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. Oper. Res. 58(2): 303-315 (2010) - [j112]James R. Luedtke, Shabbir Ahmed, George L. Nemhauser:
An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2): 247-272 (2010) - [j111]Gizem Keysan, George L. Nemhauser, Martin W. P. Savelsbergh:
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation. Transp. Sci. 44(3): 291-306 (2010) - [c15]William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes:
Automated Channel Abstraction for Advertising Auctions. AAAI 2010: 887-894 - [e2]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j110]Yongpei Guan, Shabbir Ahmed, George L. Nemhauser:
Cutting Planes for Multistage Stochastic Integer Programs. Oper. Res. 57(2): 287-298 (2009) - [j109]James R. Luedtke, George L. Nemhauser:
Strategic Planning with Start-Time Dependent Variable Costs. Oper. Res. 57(5): 1250-1261 (2009) - [j108]Fatma Kilinç-Karzan, George L. Nemhauser, Martin W. P. Savelsbergh:
Information-based branching schemes for binary linear mixed integer problems. Math. Program. Comput. 1(4): 249-293 (2009) - [j107]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) - [i1]George L. Nemhauser, Mike Hewitt, Martin W. P. Savelsbergh:
Using Branch-and-Price to Find High Quality Solutions Quickly. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j106]Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh:
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. Discret. Optim. 5(1): 19-35 (2008) - [j105]Martin Grötschel, George L. Nemhauser:
George Dantzig's contributions to integer programming. Discret. Optim. 5(2): 168-173 (2008) - [j104]Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser:
Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5(2): 467-488 (2008) - [j103]Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. INFORMS J. Comput. 20(3): 438-450 (2008) - [j102]Daniel G. Espinoza, Renan 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. Transp. Sci. 42(3): 263-278 (2008) - [j101]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transp. Sci. 42(3): 279-291 (2008) - [c14]Juan Pablo Vielma, George L. Nemhauser:
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO 2008: 199-213 - 2007
- [j100]George L. Nemhauser:
Hooked on IP. Ann. Oper. Res. 149(1): 157-161 (2007) - [j99]Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh:
Analysis of bounds for a capacitated single-item lot-sizing problem. Comput. Oper. Res. 34(6): 1721-1743 (2007) - [j98]Yongpei Guan, Shabbir Ahmed, George L. Nemhauser:
Sequential pairing of mixed integer inequalities. Discret. Optim. 4(1): 21-39 (2007) - [c13]James R. Luedtke, Shabbir Ahmed, George L. Nemhauser:
An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423 - [p1]Michael O. Ball, Cynthia Barnhart, George L. Nemhauser, Amedeo R. Odoni:
Chapter 1 Air Transportation: Irregular Operations and Control. Transportation 2007: 1-67 - 2006
- [j97]Andrew J. Schaefer, George L. Nemhauser:
Improving airline operational performance through schedule perturbation. Ann. Oper. Res. 144(1): 3-16 (2006) - [j96]Yetkin Ileri, Mokhtar Bazaraa, Ted Gifford, George L. Nemhauser, Joel S. Sokol, Erick D. Wikum:
An optimization approach for planning daily drayage operations. Central Eur. J. Oper. Res. 14(2): 141-156 (2006) - [j95]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. Eur. J. Oper. Res. 174(3): 1979-1990 (2006) - [j94]Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. Oper. Res. 54(5): 847-858 (2006) - [j93]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) - [j92]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
- [j91]Dieter Vandenbussche, George L. Nemhauser:
The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005) - [j90]Dieter Vandenbussche, George L. Nemhauser:
A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3): 531-557 (2005) - [j89]Dieter Vandenbussche, George L. Nemhauser:
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3): 559-575 (2005) - [j88]Andrew J. Schaefer, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser:
Airline Crew Scheduling Under Uncertainty. Transp. Sci. 39(3): 340-348 (2005) - [c12]Yongpei Guan, Shabbir Ahmed, George L. Nemhauser:
Sequential Pairing of Mixed Integer Inequalities. IPCO 2005: 23-34 - 2004
- [j87]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) - [j86]Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser:
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles. Transp. Sci. 38(3): 357-368 (2004) - [e1]George L. Nemhauser, Daniel Bienstock:
Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings. Lecture Notes in Computer Science 3064, Springer 2004, ISBN 3-540-22113-1 [contents] - [r1]Kelly Easton, George L. Nemhauser, Michael A. Trick:
Sports Scheduling. Handbook of Scheduling 2004 - 2003
- [j85]Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George L. Nemhauser, Alexander Shapiro:
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study. Comput. Optim. Appl. 24(2-3): 289-333 (2003) - [j84]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) - [j83]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) - [j82]Ismael R. de Farias Jr., George L. Nemhauser:
A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003) - [j81]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) - [j80]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) - [j79]Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser:
Rerouting Aircraft for Airline Recovery. Transp. Sci. 37(4): 408-421 (2003) - 2002
- [j78]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) - [j77]Diego Klabjan, George L. Nemhauser:
A Polyhedral Study of Integer Variable Upper Bounds. Math. Oper. Res. 27(4): 711-739 (2002) - [j76]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Airline Crew Scheduling with Time Windows and Plane-Count Constraints. Transp. Sci. 36(3): 337-348 (2002) - [j75]Jay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser:
A Stochastic Model of Airline Operations. Transp. Sci. 36(4): 357-377 (2002) - [c11]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 - [c10]Ismael R. de Farias Jr., George L. Nemhauser:
A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303 - [c9]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 - [c8]Jeff Day, George L. Nemhauser, Joel S. Sokol:
Management of Railroad Impedances for Shortest Path-based Routing. ATMOS 2002: 53-65 - 2001
- [j74]Gregory D. Glockner, George L. Nemhauser, Craig A. Tovey:
Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results. Comput. Optim. Appl. 18(3): 233-250 (2001) - [j73]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching. Comput. Optim. Appl. 20(1): 73-91 (2001) - [j72]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16(1): 25-39 (2001) - [j71]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid inequalities for problems with additive variable upper bounds. Math. Program. 91(1): 145-162 (2001) - [j70]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) - [j69]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Airline Crew Scheduling with Regularity. Transp. Sci. 35(4): 359-374 (2001) - [c7]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 - [c6]Kelly Easton, George L. Nemhauser, Michael A. Trick:
The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584 - [c5]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 - 2000
- [j68]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1): 40-55 (2000) - [j67]Natashia L. Boland, Lloyd W. Clarke, George L. Nemhauser:
The asymmetric traveling salesman problem with replenishment arcs. Eur. J. Oper. Res. 123(2): 408-427 (2000) - [j66]Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh:
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. Eur. J. Oper. Res. 125(2): 298-315 (2000) - [j65]Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh:
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS J. Comput. 12(1): 2-23 (2000) - [j64]Gregory D. Glockner, George L. Nemhauser:
A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure. Oper. Res. 48(2): 233-242 (2000) - [j63]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Sequence Independent Lifting in Mixed Integer Programming. J. Comb. Optim. 4(1): 109-129 (2000) - [j62]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
The mixed vertex packing problem. Math. Program. 89(1): 35-53 (2000) - [j61]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89(1): 187-203 (2000) - [j60]Diego Klabjan, Ellis L. Johnson, George L. Nemhauser:
A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2): 47-55 (2000) - [j59]Ladislav Lettovsky, Ellis L. Johnson, George L. Nemhauser:
Airline Crew Recovery. Transp. Sci. 34(4): 337-348 (2000) - [c4]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. WSC 2000: 1118-1122
1990 – 1999
- 1999
- [j58]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. INFORMS J. Comput. 11(1): 117-123 (1999) - [j57]Daniel Adelman, George L. Nemhauser:
Price-Directed Control of Remnant Inventory Systems. Oper. Res. 47(6): 889-898 (1999) - [j56]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85(3): 439-467 (1999) - [j55]Daniel Adelman, George L. Nemhauser, Mario Padron, Robert Stubbs, Ram Pandit:
Allocating Fibers in Cable Manufacturing. Manuf. Serv. Oper. Manag. 1(1): 21-35 (1999) - [c3]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
Valid Inequalities for Problems with Additive Variable Upper Bounds. IPCO 1999: 60-72 - 1998
- [j54]Dasong Cao, George L. Nemhauser:
Polyhedral Characterizations, Perfection of Line Graphs. Discret. Appl. Math. 81(1-3): 141-154 (1998) - [j53]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Computation. INFORMS J. Comput. 10(4): 427-437 (1998) - [j52]George L. Nemhauser, Michael A. Trick:
Scheduling A Major College Basketball Conference. Oper. Res. 46(1): 1-8 (1998) - [j51]Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, Pamela H. Vance:
Branch-and-Price: Column Generation for Solving Huge Integer Programs. Oper. Res. 46(3): 316-329 (1998) - [j50]Diego Klabjan, George L. Nemhauser, Craig A. Tovey:
The complexity of cover inequality separation. Oper. Res. Lett. 23(1-2): 35-40 (1998) - [j49]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. Transp. Sci. 32(3): 208-220 (1998) - 1997
- [j48]Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Zhongxi Zhu:
The aircraft rotation problem. Ann. Oper. Res. 69: 33-46 (1997) - [j47]Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser:
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm. Oper. Res. 45(2): 188-200 (1997) - 1996
- [j46]Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. J. Heuristics 1(2): 247-259 (1996) - [j45]Lloyd W. Clarke, Christopher A. Hane, Ellis L. Johnson, George L. Nemhauser:
Maintenance and Crew Considerations in Fleet Assignment. Transp. Sci. 30(3): 249-260 (1996) - [c2]George L. Nemhauser:
Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). CP 1996: 570 - 1995
- [j44]Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, George L. Nemhauser, Gabriele Sigismondi:
The fleet assignment problem: Solving a large-scale integer program. Math. Program. 70: 211-232 (1995) - [c1]Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Sequence Independent Lifting of Cover Inequalities. IPCO 1995: 452-461 - 1994
- [j43]Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser:
Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3(2): 111-130 (1994) - [j42]George L. Nemhauser:
The Age of Optimization: Solving Large-Scale Real-World Problems. Oper. Res. 42(1): 5-13 (1994) - [j41]George L. Nemhauser, Martin W. P. Savelsbergh, Gabriele Sigismondi:
MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15(1): 47-58 (1994) - [j40]Zonghao Gu, Ellis L. Johnson, George L. Nemhauser, Wang Yinhua:
Some properties of the fleet assignment problem. Oper. Res. Lett. 15(2): 59-71 (1994) - [j39]Erick D. Wikum, Donna Crystal Llewellyn, George L. Nemhauser:
One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16(2): 87-99 (1994) - [j38]George L. Nemhauser, Pamela H. Vance:
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints. Oper. Res. Lett. 16(5): 255-263 (1994) - 1993
- [j37]Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Gabriele Sigismondi, Pamela H. Vance:
Formulating a Mixed Integer Programming Problem to Improve Solvability. Oper. Res. 41(6): 1013-1019 (1993) - [j36]Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser:
Min-cut clustering. Math. Program. 62: 133-151 (1993) - [j35]Russell A. Rushmeier, George L. Nemhauser:
Experiments with parallel branch-and-bound algorithms for the set covering problem. Oper. Res. Lett. 13(5): 277-285 (1993) - 1992
- [j34]Ellis L. Johnson, George L. Nemhauser:
Recent Developments and Future Directions in Mathematical Programming. IBM Syst. J. 31(1): 79-93 (1992) - 1991
- [j33]Ronny Aboudi, George L. Nemhauser:
Some Facets for an Assignment Problem with Side Constraints. Oper. Res. 39(2): 244-250 (1991) - [j32]George L. Nemhauser, Sungsoo Park:
A polyhedral approach to edge coloring. Oper. Res. Lett. 10(6): 315-322 (1991) - 1990
- [j31]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)
1980 – 1989
- 1988
- [b1]George L. Nemhauser, Laurence A. Wolsey:
Integer and Combinatorial Optimization. Wiley interscience series in discrete mathematics and optimization, Wiley 1988, ISBN 978-0-471-82819-8, pp. I-XIV, 1-763 - 1986
- [j30]Yoshiro Ikura, George L. Nemhauser:
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem. Discret. Appl. Math. 13(2-3): 239-248 (1986) - 1985
- [j29]Yoshiro Ikura, George L. Nemhauser:
Simplex pivots on the set packing polytope. Math. Program. 33(2): 123-138 (1985) - 1984
- [j28]Martin Grötschel, George L. Nemhauser:
A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Program. 29(1): 28-40 (1984) - 1982
- [j27]Wen-Lian Hsu, George L. Nemhauser:
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. Discret. Math. 38(1): 65-71 (1982) - [j26]Gerard J. Chang, George L. Nemhauser:
R-domination on block graphs. Oper. Res. Lett. 1(6): 214-218 (1982) - 1981
- [j25]Wen-Lian Hsu, George L. Nemhauser:
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. Discret. Math. 37(2-3): 181-191 (1981) - [j24]Wen-Lian Hsu, Yoshiro Ikura, George L. Nemhauser:
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. Math. Program. 20(1): 225-232 (1981) - [j23]George L. Nemhauser:
Editorial. Oper. Res. Lett. 1(1): 1 (1981) - [j22]Eliane A. Gattass, George L. Nemhauser:
An application of vertex packing to data analysis in the evaluation of pavement deterioration. Oper. Res. Lett. 1(1): 13-17 (1981) - 1980
- [j21]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. Oper. Res. 28(4): 847-858 (1980) - [j20]Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
A Canonical Representation of Simple Plant Location Problems and Its Applications. SIAM J. Algebraic Discret. Methods 1(3): 261-272 (1980)
1970 – 1979
- 1979
- [j19]Wen-Lian Hsu, George L. Nemhauser:
Easy and hard bottleneck location problems. Discret. Appl. Math. 1(3): 209-215 (1979) - [j18]Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey:
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. Oper. Res. 27(4): 799-809 (1979) - [j17]Michael O. Ball, George L. Nemhauser:
Matroids and a Reliability Analysis Problem. Math. Oper. Res. 4(2): 132-143 (1979) - 1978
- [j16]George L. Nemhauser, Laurence A. Wolsey:
Best Algorithms for Approximating the Maximum of a Submodular Set Function. Math. Oper. Res. 3(3): 177-188 (1978) - [j15]Gérard Cornuéjols, George L. Nemhauser:
Tight bounds for christofides' traveling salesman heuristic. Math. Program. 14(1): 116-121 (1978) - [j14]George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher:
An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1): 265-294 (1978) - 1975
- [j13]Michael J. Magazine, George L. Nemhauser, Leslie E. Trotter Jr.:
When the Greedy Solution Solves a Class of Knapsack Problems. Oper. Res. 23(2): 207-217 (1975) - [j12]George L. Nemhauser, Leslie E. Trotter Jr.:
Vertex packings: Structural properties and algorithms. Math. Program. 8(1): 232-248 (1975) - 1974
- [j11]T. King, George L. Nemhauser:
Some inequalities on the chromatic number of a graph. Discret. Math. 10(1): 117-121 (1974) - [j10]George L. Nemhauser, Leslie E. Trotter Jr.:
Properties of vertex packing and independence system polyhedra. Math. Program. 6(1): 48-61 (1974) - 1973
- [j9]George L. Nemhauser, A. C. Williams, Sanjoy K. Mitter, Joseph T. Howson:
Book reviews. Math. Program. 4(1): 113-118 (1973) - 1972
- [j8]George L. Nemhauser, P. L. Yu:
A Problem in Bulk Service Scheduling. Oper. Res. 20(4): 813-819 (1972) - 1971
- [j7]George L. Nemhauser, William B. Widhelm:
A Modified Linear Program for Columnar Methods in Mathematical Programming. Oper. Res. 19(4): 1051-1060 (1971)
1960 – 1969
- 1969
- [j6]Robert S. Garfinkel, George L. Nemhauser:
The Set-Partitioning Problem: Set Covering with Equality Constraints. Oper. Res. 17(5): 848-856 (1969) - 1968
- [j5]A. C. Fisher, J. S. Liebman, George L. Nemhauser:
Computer construction of project networks. Commun. ACM 11(7): 493-497 (1968) - [j4]George L. Nemhauser, Zev Ullmann:
Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem. Oper. Res. 16(2): 450-453 (1968) - [j3]Mandell Bellmore, George L. Nemhauser:
The Traveling Salesman Problem: A Survey. Oper. Res. 16(3): 538-558 (1968) - 1967
- [j2]Alan J. Goldman, George L. Nemhauser:
A Transport Improvement Problem Transformable to a Best-Path Problem. Transp. Sci. 1(4): 295-307 (1967) - 1966
- [j1]R. C. Carlson, George L. Nemhauser:
Scheduling to Minimize Interaction Cost. Oper. Res. 14(1): 52-58 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
