George L. Nemhauser

186 papers A* 4A 2B 10C 3Misc 1Journal 160Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Distributionally robust disaster relief planning under the Wasserstein set.
Comput. Oper. Res.
Mohamed El Tonbari, George L. Nemhauser, Alejandro Toriello
2022 J jnl
An exact algorithm for the service network design problem with hub capacity constraints.
Networks
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
2022 J jnl
Decomposition of loosely coupled integer programs: a multiobjective perspective.
Math. Program.
Merve Bodur, Shabbir Ahmed, Natashia Boland, George L. Nemhauser
2022 J jnl
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems.
INFORMS J. Comput.
Edward Yuhang He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
2022 J jnl
State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems.
INFORMS J. Comput.
Hossein Hashemi Doulabi, Shabbir Ahmed, George L. Nemhauser
2021 J jnl
Decentralized online integer programming problems with a coupling cardinality constraint.
Comput. Oper. Res.
Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser
2021 J jnl
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting.
INFORMS J. Comput.
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
2020 J jnl
A Simulated Annealing Algorithm for the Directed Steiner Tree Problem.
CoRR
Matías Siebert, Shabbir Ahmed, George L. Nemhauser
2020 J jnl
A linear programming based approach to the Steiner tree problem with a fixed number of terminals.
Networks
Matías Siebert, Shabbir Ahmed, George L. Nemhauser
2020 J jnl
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint.
Discret. Optim.
Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser
2019 J jnl
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.
Comput. Oper. Res.
Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou
2018 B conf
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.
CPAIOR
Edward He, Natashia Boland, George L. Nemhauser, Martin W. P. Savelsbergh
2018 J jnl
A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals.
CoRR
Matías Siebert, Shabbir Ahmed, George L. Nemhauser
2018 J jnl
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs.
Comput. Optim. Appl.
Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Yufen Shao
2018 J jnl
Flexible solutions to maritime inventory routing problems with delivery time windows.
Comput. Oper. Res.
Chengliang Zhang, George L. Nemhauser, Joel Sokol, Myun-Seok Cheon, Ahmet B. Keha
2018 J jnl
Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation.
Int. J. Prod. Res.
Matías Siebert, Kelly Bartlett, Haejoong Kim, Shabbir Ahmed, Junho Lee, Dima Nazzal, George L. Nemhauser, Joel Sokol
2017 J jnl
A hybrid primal heuristic for finding feasible solutions to mixed integer programs.
Eur. J. Oper. Res.
Carlos Eduardo de Andrade, Shabbir Ahmed, George L. Nemhauser, Yufen Shao
2017 J jnl
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.
Comput. Oper. Res.
Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Vikas Goel, Yufen Shao
2017 J jnl
An abstract model for branching and its application to mixed integer programming.
Math. Program.
Pierre Le Bodic, George L. Nemhauser
2017 J jnl
Erratum to: An abstract model for branching and its application to mixed integer programming.
Math. Program.
Pierre Le Bodic, George L. Nemhauser
2017 A* conf
Estimating the size of search trees by sampling with domain knowledge.
IJCAI
Gleb Belov, Samuel Esler, Dylan Fernando, Pierre Le Bodic, George L. Nemhauser
2017 A* conf
Learning to Run Heuristics in Tree Search.
IJCAI
Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao
2016 A* conf
Learning to Branch in Mixed Integer Programming.
AAAI
Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina
2016 J jnl
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.
SIAM J. Optim.
Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser
2016 J jnl
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid.
CoRR
Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser
2015 J jnl
A dual heuristic for mixed integer programming.
Oper. Res. Lett.
Yaxian Li, Özlem Ergun, George L. Nemhauser
2015 J jnl
An Abstract Model for Branching and its Application to Mixed Integer Programming.
CoRR
Pierre Le Bodic, George L. Nemhauser
2015 J jnl
Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems.
Transp. Sci.
Dimitri J. Papageorgiou, Myun-Seok Cheon, George L. Nemhauser, Joel Sokol
2015 J jnl
How important are branching decisions: Fooling MIP solvers.
Oper. Res. Lett.
Pierre Le Bodic, George L. Nemhauser
2015 J jnl
Minimum concave cost flow over a grid network.
Math. Program.
Qie He, Shabbir Ahmed, George L. Nemhauser
2014 J jnl
A cutting and scheduling problem in float glass manufacturing.
J. Sched.
Byungsoo Na, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol
2014 J jnl
Congestion-aware dynamic routing in automated material handling systems.
Comput. Ind. Eng.
Kelly Bartlett, Junho Lee, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol, Byungsoo Na
2014 J jnl
MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results.
Eur. J. Oper. Res.
Dimitri J. Papageorgiou, George L. Nemhauser, Joel S. Sokol, Myun-Seok Cheon, Ahmet B. Keha
2014 J jnl
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing.
INFORMS J. Comput.
Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol
2014 J jnl
Using diversification, communication and parallelism to solve mixed-integer linear programs.
Oper. Res. Lett.
Rodolfo Carvajal, Shabbir Ahmed, George L. Nemhauser, Kevin C. Furman, Vikas Goel, Yufen Shao
2013 J jnl
A branch-and-price guided search approach to maritime inventory routing.
Comput. Oper. Res.
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
2013 J jnl
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem.
INFORMS J. Comput.
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
2013 J jnl
Restrict-and-relax search for 0-1 mixed-integer programs.
EURO J. Comput. Optim.
Menal Guzelsoy, George L. Nemhauser, Martin W. P. Savelsbergh
2012 J jnl
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing.
Oper. Res.
Faramroze G. Engineer, Kevin C. Furman, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
2012 C conf
Branch-and-Price Guided Search - (Extended Abstract).
ISCO
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
2012 J jnl
Fixed-Charge Transportation with Product Blending.
Transp. Sci.
Dimitri J. Papageorgiou, Alejandro Toriello, George L. Nemhauser, Martin W. P. Savelsbergh
2012 J jnl
Mixed integer linear programming formulations for probabilistic constraints.
Oper. Res. Lett.
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
2012 J jnl
Pricing for production and delivery flexibility in single-item lot-sizing.
Comput. Oper. Res.
Yaxian Li, George L. Nemhauser, Martin W. P. Savelsbergh
2012 J jnl
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem.
Oper. Res. Lett.
Qie He, Shabbir Ahmed, George L. Nemhauser
2012 J jnl
The Fixed-Charge Shortest-Path Problem.
INFORMS J. Comput.
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
2012 J jnl
The value function of an infinite-horizon single-item lot-sizing problem.
Oper. Res. Lett.
Alejandro Toriello, George L. Nemhauser
2011 J jnl
A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs.
SIAM J. Optim.
Qie He, Shabbir Ahmed, George L. Nemhauser
2011 J jnl
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem.
INFORMS J. Comput.
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh
2011 J jnl
Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study.
INFORMS J. Comput.
Amar Kumar Narisetty, Jean-Philippe P. Richard, George L. Nemhauser
2011 J jnl
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.
Math. Program.
Juan Pablo Vielma, George L. Nemhauser
2010 — book
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art
Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010 J jnl
A Note on "A Superior Representation Method for Piecewise Linear Functions".
INFORMS J. Comput.
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
2010 J jnl
An integer programming approach for linear programs with probabilistic constraints.
Math. Program.
James R. Luedtke, Shabbir Ahmed, George L. Nemhauser
2010 A* conf
Automated Channel Abstraction for Advertising Auctions.
AAAI
William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes
2010 J jnl
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem.
INFORMS J. Comput.
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
2010 J jnl
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions.
Oper. Res.
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
2010 J jnl
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation.
Transp. Sci.
Gizem Keysan, George L. Nemhauser, Martin W. P. Savelsbergh
2009 J jnl
Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett.
Fatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh
2009 J jnl
Cutting Planes for Multistage Stochastic Integer Programs.
Oper. Res.
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
2009 J jnl
Information-based branching schemes for binary linear mixed integer problems.
Math. Program. Comput.
Fatma Kilinç-Karzan, George L. Nemhauser, Martin W. P. Savelsbergh
2009 J jnl
Strategic Planning with Start-Time Dependent Variable Costs.
Oper. Res.
James R. Luedtke, George L. Nemhauser
2009 — conf
Using Branch-and-Price to Find High Quality Solutions Quickly.
Models and Algorithms for Optimization in Logistics
George L. Nemhauser, Mike Hewitt, Martin W. P. Savelsbergh
2008 J jnl
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
INFORMS J. Comput.
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
2008 J jnl
George Dantzig's contributions to integer programming.
Discret. Optim.
Martin Grötschel, George L. Nemhauser
2008 B conf
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.
IPCO
Juan Pablo Vielma, George L. Nemhauser
2008 J jnl
Nonconvex, lower semicontinuous piecewise linear optimization.
Discret. Optim.
Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser
2008 J jnl
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transp. Sci.
Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh
2008 J jnl
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transp. Sci.
Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh
2008 J jnl
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.
Discret. Optim.
Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
2007 B conf
An Integer Programming Approach for Linear Programs with Probabilistic Constraints.
IPCO
James R. Luedtke, Shabbir Ahmed, George L. Nemhauser
2007 J jnl
Analysis of bounds for a capacitated single-item lot-sizing problem.
Comput. Oper. Res.
Jill R. Hardin, George L. Nemhauser, Martin W. P. Savelsbergh
2007 — ch.
Chapter 1 Air Transportation: Irregular Operations and Control.
Transportation
Michael O. Ball, Cynthia Barnhart, George L. Nemhauser, Amedeo R. Odoni
2007 J jnl
Hooked on IP.
Ann. Oper. Res.
George L. Nemhauser
2007 J jnl
Sequential pairing of mixed integer inequalities.
Discret. Optim.
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
2006 J jnl
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization.
Oper. Res.
Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
2006 J jnl
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.
Math. Program.
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller
2006 J jnl
An optimization approach for planning daily drayage operations.
Central Eur. J. Oper. Res.
Yetkin Ileri, Mokhtar S. Bazaraa, Ted Gifford, George L. Nemhauser, Joel S. Sokol, Erick D. Wikum
2006 J jnl
Improving airline operational performance through schedule perturbation.
Ann. Oper. Res.
Andrew J. Schaefer, George L. Nemhauser
2006 J jnl
On formulations of the stochastic uncapacitated lot-sizing problem.
Oper. Res. Lett.
Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser
2006 J jnl
Short-term booking of air cargo space.
Eur. J. Oper. Res.
Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, George L. Nemhauser, Joel S. Sokol, Chun How Leong
2005 J jnl
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.
Math. Program.
Dieter Vandenbussche, George L. Nemhauser
2005 J jnl
A polyhedral study of nonconvex quadratic programs with box constraints.
Math. Program.
Dieter Vandenbussche, George L. Nemhauser
2005 J jnl
Airline Crew Scheduling Under Uncertainty.
Transp. Sci.
Andrew J. Schaefer, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser
2005 B conf
Sequential Pairing of Mixed Integer Inequalities.
IPCO
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
2005 J jnl
The 2-Edge-Connected Subgraph Polyhedron.
J. Comb. Optim.
Dieter Vandenbussche, George L. Nemhauser
2004 J jnl
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles.
Transp. Sci.
Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser
2004 B ed.
Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
IPCO
George L. Nemhauser, Daniel Bienstock
2004 J jnl
Models for representing piecewise linear cost functions.
Oper. Res. Lett.
Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
2004 — ch.
Sports Scheduling.
Handbook of Scheduling
Kelly Easton, George L. Nemhauser, Michael A. Trick
2003 J jnl
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case.
Math. Program.
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
2003 J jnl
A polyhedral study of the cardinality constrained knapsack problem.
Math. Program.
Ismael R. de Farias Jr., George L. Nemhauser
2003 J jnl
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.
Math. Program.
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2003 J jnl
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting.
Math. Program.
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2003 J jnl
On the polyhedral structure of a multi-item production planning model with setup times.
Math. Program.
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
2003 J jnl
Rerouting Aircraft for Airline Recovery.
Transp. Sci.
Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser
2003 J jnl
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study.
Comput. Optim. Appl.
Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George L. Nemhauser, Alexander Shapiro
2002 J jnl
A Polyhedral Study of Integer Variable Upper Bounds.
Math. Oper. Res.
Diego Klabjan, George L. Nemhauser
2002 B conf
A Polyhedral Study of the Cardinality Constrained Knapsack Problem.
IPCO
Ismael R. de Farias Jr., George L. Nemhauser
2002 J jnl
A Stochastic Model of Airline Operations.
Transp. Sci.
Jay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser
2002 J jnl
Airline Crew Scheduling with Time Windows and Plane-Count Constraints.
Transp. Sci.
Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy
2002 J jnl
Facets of the Complementarity Knapsack Polytope.
Math. Oper. Res.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
2002 B conf
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms.
IPCO
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2002 C conf
Management of Railroad Impedances for Shortest Path-based Routing.
ATMOS
Jeff Day, George L. Nemhauser, Joel S. Sokol
2002 C conf
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach.
PATAT
Kelly Easton, George L. Nemhauser, Michael A. Trick
2001 — conf
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.
Combinatorial Optimization
Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
2001 J jnl
A family of inequalities for the generalized assignment polytope.
Oper. Res. Lett.
Ismael R. de Farias Jr., George L. Nemhauser
2001 J jnl
Airline Crew Scheduling with Regularity.
Transp. Sci.
Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy
2001 J jnl
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables.
Knowl. Eng. Rev.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
2001 J jnl
Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results.
Comput. Optim. Appl.
Gregory D. Glockner, George L. Nemhauser, Craig A. Tovey
2001 B conf
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.
IPCO
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
2001 J jnl
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching.
Comput. Optim. Appl.
Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy
2001 A conf
The Traveling Tournament Problem Description and Benchmarks.
CP
Kelly Easton, George L. Nemhauser, Michael A. Trick
2001 J jnl
Valid inequalities for problems with additive variable upper bounds.
Math. Program.
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
2000 J jnl
A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure.
Oper. Res.
Gregory D. Glockner, George L. Nemhauser
2000 J jnl
A generalized assignment problem with special ordered sets: a polyhedral approach.
Math. Program.
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
2000 J jnl
A parallel primal-dual simplex algorithm.
Oper. Res. Lett.
Diego Klabjan, Ellis L. Johnson, George L. Nemhauser
2000 Misc conf
Air transportation simulation: SimAir: a stochastic model of airline operations.
WSC
Jay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser
2000 J jnl
Airline Crew Recovery.
Transp. Sci.
Ladislav Lettovsky, Ellis L. Johnson, George L. Nemhauser
2000 J jnl
Conflict graphs in solving integer programming problems.
Eur. J. Oper. Res.
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
2000 J jnl
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra.
Eur. J. Oper. Res.
Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh
2000 J jnl
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition.
INFORMS J. Comput.
Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh
2000 J jnl
Sequence Independent Lifting in Mixed Integer Programming.
J. Comb. Optim.
Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
2000 J jnl
The asymmetric traveling salesman problem with replenishment arcs.
Eur. J. Oper. Res.
Natashia L. Boland, Lloyd W. Clarke, George L. Nemhauser
2000 J jnl
The mixed vertex packing problem.
Math. Program.
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
1999 J jnl
Allocating Fibers in Cable Manufacturing.
Manuf. Serv. Oper. Manag.
Daniel Adelman, George L. Nemhauser, Mario Padron, Robert Stubbs, Ram Pandit
1999 J jnl
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity.
INFORMS J. Comput.
Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
1999 J jnl
Lifted flow cover inequalities for mixed 0-1 integer programs.
Math. Program.
Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
1999 J jnl
Price-Directed Control of Remnant Inventory Systems.
Oper. Res.
Daniel Adelman, George L. Nemhauser
1999 B conf
Valid Inequalities for Problems with Additive Variable Upper Bounds.
IPCO
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
1998 J jnl
Branch-and-Price: Column Generation for Solving Huge Integer Programs.
Oper. Res.
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, Pamela H. Vance
1998 J jnl
Flight String Models for Aircraft Fleeting and Routing.
Transp. Sci.
Cynthia Barnhart, Natashia L. Boland, Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Rajesh G. Shenoi
1998 J jnl
Lifted Cover Inequalities for 0-1 Integer Programs: Computation.
INFORMS J. Comput.
Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
1998 J jnl
Polyhedral Characterizations, Perfection of Line Graphs.
Discret. Appl. Math.
Dasong Cao, George L. Nemhauser
1998 J jnl
Scheduling A Major College Basketball Conference.
Oper. Res.
George L. Nemhauser, Michael A. Trick
1998 J jnl
The complexity of cover inequality separation.
Oper. Res. Lett.
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
1997 J jnl
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm.
Oper. Res.
Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser
1997 J jnl
The aircraft rotation problem.
Ann. Oper. Res.
Lloyd W. Clarke, Ellis L. Johnson, George L. Nemhauser, Zhongxi Zhu
1996 J jnl
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.
J. Heuristics
Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh
1996 A conf
Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract).
CP
George L. Nemhauser
1996 J jnl
Maintenance and Crew Considerations in Fleet Assignment.
Transp. Sci.
Lloyd W. Clarke, Christopher A. Hane, Ellis L. Johnson, George L. Nemhauser
1995 B conf
Sequence Independent Lifting of Cover Inequalities.
IPCO
Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
1995 J jnl
The fleet assignment problem: Solving a large-scale integer program.
Math. Program.
Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, George L. Nemhauser, Gabriele Sigismondi
1994 J jnl
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints.
Oper. Res. Lett.
George L. Nemhauser, Pamela H. Vance
1994 J jnl
MINTO, a mixed INTeger optimizer.
Oper. Res. Lett.
George L. Nemhauser, Martin W. P. Savelsbergh, Gabriele Sigismondi
1994 J jnl
One-machine generalized precedence constrained scheduling problems.
Oper. Res. Lett.
Erick D. Wikum, Donna Crystal Llewellyn, George L. Nemhauser
1994 J jnl
Solving binary cutting stock problems by column generation and branch-and-bound.
Comput. Optim. Appl.
Pamela H. Vance, Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser
1994 J jnl
Some properties of the fleet assignment problem.
Oper. Res. Lett.
Zonghao Gu, Ellis L. Johnson, George L. Nemhauser, Wang Yinhua
1994 J jnl
The Age of Optimization: Solving Large-Scale Real-World Problems.
Oper. Res.
George L. Nemhauser
1993 J jnl
Experiments with parallel branch-and-bound algorithms for the set covering problem.
Oper. Res. Lett.
Russell A. Rushmeier, George L. Nemhauser
1993 J jnl
Formulating a Mixed Integer Programming Problem to Improve Solvability.
Oper. Res.
Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Gabriele Sigismondi, Pamela H. Vance
1993 J jnl
Min-cut clustering.
Math. Program.
Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser
1992 J jnl
Recent Developments and Future Directions in Mathematical Programming.
IBM Syst. J.
Ellis L. Johnson, George L. Nemhauser
1991 J jnl
A polyhedral approach to edge coloring.
Oper. Res. Lett.
George L. Nemhauser, Sungsoo Park
1991 J jnl
Some Facets for an Assignment Problem with Side Constraints.
Oper. Res.
Ronny Aboudi, George L. Nemhauser
1990 J jnl
A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs.
Math. Program.
George L. Nemhauser, Laurence A. Wolsey
1988 — book
Integer and Combinatorial Optimization.
George L. Nemhauser, Laurence A. Wolsey
1986 J jnl
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem.
Discret. Appl. Math.
Yoshiro Ikura, George L. Nemhauser
1985 J jnl
Simplex pivots on the set packing polytope.
Math. Program.
Yoshiro Ikura, George L. Nemhauser
1984 J jnl
A polynomial algorithm for the max-cut problem on graphs without long odd cycles.
Math. Program.
Martin Grötschel, George L. Nemhauser
1982 J jnl
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs.
Discret. Math.
Wen-Lian Hsu, George L. Nemhauser
1982 J jnl
R-domination on block graphs.
Oper. Res. Lett.
Gerard J. Chang, George L. Nemhauser
1981 J jnl
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles.
Math. Program.
Wen-Lian Hsu, Yoshiro Ikura, George L. Nemhauser
1981 J jnl
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs.
Discret. Math.
Wen-Lian Hsu, George L. Nemhauser
1981 J jnl
An application of vertex packing to data analysis in the evaluation of pavement deterioration.
Oper. Res. Lett.
Eliane A. Gattass, George L. Nemhauser
1981 J jnl
Editorial.
Oper. Res. Lett.
George L. Nemhauser
1980 J jnl
A Canonical Representation of Simple Plant Location Problems and Its Applications.
SIAM J. Algebraic Discret. Methods
Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1980 J jnl
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.
Oper. Res.
Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey
1979 J jnl
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit.
Oper. Res.
Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey
1979 J jnl
Easy and hard bottleneck location problems.
Discret. Appl. Math.
Wen-Lian Hsu, George L. Nemhauser
1979 J jnl
Matroids and a Reliability Analysis Problem.
Math. Oper. Res.
Michael O. Ball, George L. Nemhauser
1978 J jnl
An analysis of approximations for maximizing submodular set functions - I.
Math. Program.
George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher
1978 J jnl
Best Algorithms for Approximating the Maximum of a Submodular Set Function.
Math. Oper. Res.
George L. Nemhauser, Laurence A. Wolsey
1978 J jnl
Tight bounds for christofides' traveling salesman heuristic.
Math. Program.
Gérard Cornuéjols, George L. Nemhauser
1975 J jnl
Vertex packings: Structural properties and algorithms.
Math. Program.
George L. Nemhauser, Leslie E. Trotter Jr.
1975 J jnl
When the Greedy Solution Solves a Class of Knapsack Problems.
Oper. Res.
Michael J. Magazine, George L. Nemhauser, Leslie E. Trotter Jr.
1974 J jnl
Properties of vertex packing and independence system polyhedra.
Math. Program.
George L. Nemhauser, Leslie E. Trotter Jr.
1974 J jnl
Some inequalities on the chromatic number of a graph.
Discret. Math.
T. King, George L. Nemhauser
1973 J jnl
Book reviews.
Math. Program.
George L. Nemhauser, A. C. Williams, Sanjoy K. Mitter, Joseph T. Howson
1972 J jnl
A Problem in Bulk Service Scheduling.
Oper. Res.
George L. Nemhauser, P. L. Yu
1971 J jnl
A Modified Linear Program for Columnar Methods in Mathematical Programming.
Oper. Res.
George L. Nemhauser, William B. Widhelm
1969 J jnl
The Set-Partitioning Problem: Set Covering with Equality Constraints.
Oper. Res.
Robert S. Garfinkel, George L. Nemhauser
1968 J jnl
Computer construction of project networks.
Commun. ACM
A. C. Fisher, J. S. Liebman, George L. Nemhauser
1968 J jnl
Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem.
Oper. Res.
George L. Nemhauser, Zev Ullmann
1968 J jnl
The Traveling Salesman Problem: A Survey.
Oper. Res.
Mandell Bellmore, George L. Nemhauser
1967 J jnl
A Transport Improvement Problem Transformable to a Best-Path Problem.
Transp. Sci.
Alan J. Goldman, George L. Nemhauser
1966 J jnl
Scheduling to Minimize Interaction Cost.
Oper. Res.
R. C. Carlson, George L. Nemhauser