George L. Nemhauser

Publication Activity (10 Years)

Years Active: 1966-2024
Publications (10 Years): 24

Top Venues

Comput. Oper. Res.

CoRR

Math. Program.

Oper. Res. Lett.

Publications

Mohamed El Tonbari, George L. Nemhauser, Alejandro Toriello
Distributionally robust disaster relief planning under the Wasserstein set. Comput. Oper. Res. 168 (2024)
Merve Bodur, Shabbir Ahmed, Natashia Boland, George L. Nemhauser
Decomposition of loosely coupled integer programs: a multiobjective perspective. Math. Program. 196 (1) (2022)
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) (2022)
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) (2022)
Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser
Decentralized online integer programming problems with a coupling cardinality constraint. Comput. Oper. Res. 135 (2021)
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) (2021)
Ezgi Karabulut, Shabbir Ahmed, George L. Nemhauser
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint. Discret. Optim. 38 (2020)
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) (2020)
Matías Siebert, Shabbir Ahmed, George L. Nemhauser
A Simulated Annealing Algorithm for the Directed Steiner Tree Problem. CoRR (2020)
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 (2019)
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)
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) (2018)
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 (2018)
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) (2018)
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 (2018)
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) (2017)
Elias B. Khalil, Bistra Dilkina, George L. Nemhauser, Shabbir Ahmed, Yufen Shao
Learning to Run Heuristics in Tree Search. IJCAI (2017)
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 (2017)
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)
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) (2017)
Pierre Le Bodic, George L. Nemhauser
An abstract model for branching and its application to mixed integer programming. Math. Program. 166 (1-2) (2017)
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) (2016)
Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, Bistra Dilkina
Learning to Branch in Mixed Integer Programming. AAAI (2016)
Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. CoRR (2016)
Pierre Le Bodic, George L. Nemhauser
An Abstract Model for Branching and its Application to Mixed Integer Programming. CoRR (2015)
Yaxian Li, Özlem Ergun, George L. Nemhauser
A dual heuristic for mixed integer programming. Oper. Res. Lett. 43 (4) (2015)
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) (2015)
Qie He, Shabbir Ahmed, George L. Nemhauser
Minimum concave cost flow over a grid network. Math. Program. 150 (1) (2015)
Pierre Le Bodic, George L. Nemhauser
How important are branching decisions: Fooling MIP solvers. Oper. Res. Lett. 43 (3) (2015)
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) (2014)
Byungsoo Na, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol
A cutting and scheduling problem in float glass manufacturing. J. Sched. 17 (1) (2014)
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) (2014)
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) (2014)
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 (2014)
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) (2013)
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) (2013)
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) (2013)
Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song
The Fixed-Charge Shortest-Path Problem. INFORMS J. Comput. 24 (4) (2012)
Dimitri J. Papageorgiou, Alejandro Toriello, George L. Nemhauser, Martin W. P. Savelsbergh
Fixed-Charge Transportation with Product Blending. Transp. Sci. 46 (2) (2012)
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) (2012)
Qie He, Shabbir Ahmed, George L. Nemhauser
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. Oper. Res. Lett. 40 (2) (2012)
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) (2012)
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
Mixed integer linear programming formulations for probabilistic constraints. Oper. Res. Lett. 40 (3) (2012)
Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh
Branch-and-Price Guided Search - (Extended Abstract). ISCO (2012)
Alejandro Toriello, George L. Nemhauser
The value function of an infinite-horizon single-item lot-sizing problem. Oper. Res. Lett. 40 (1) (2012)
Juan Pablo Vielma, George L. Nemhauser
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128 (1-2) (2011)
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) (2011)
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) (2011)
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) (2011)
William E. Walsh, Craig Boutilier, Tuomas Sandholm, Rob Shields, George L. Nemhauser, David C. Parkes
Automated Channel Abstraction for Advertising Auctions. AAAI (2010)
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. Oper. Res. 58 (2) (2010)
James R. Luedtke, Shabbir Ahmed, George L. Nemhauser
An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122 (2) (2010)
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) (2010)
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) (2010)
Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser
A Note on "A Superior Representation Method for Piecewise Linear Functions". INFORMS J. Comput. 22 (3) (2010)
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) (2009)
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)
James R. Luedtke, George L. Nemhauser
Strategic Planning with Start-Time Dependent Variable Costs. Oper. Res. 57 (5) (2009)
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) (2009)
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
Cutting Planes for Multistage Stochastic Integer Programs. Oper. Res. 57 (2) (2009)
Martin Grötschel, George L. Nemhauser
George Dantzig's contributions to integer programming. Discret. Optim. 5 (2) (2008)
Juan Pablo Vielma, George L. Nemhauser
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. IPCO (2008)
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) (2008)
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) (2008)
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) (2008)
Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser
Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5 (2) (2008)
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) (2008)
George L. Nemhauser
Hooked on IP. Ann. Oper. Res. 149 (1) (2007)
James R. Luedtke, Shabbir Ahmed, George L. Nemhauser
An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO (2007)
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
Sequential pairing of mixed integer inequalities. Discret. Optim. 4 (1) (2007)
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) (2007)
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) (2006)
Yongpei Guan, Shabbir Ahmed, Andrew J. Miller, George L. Nemhauser
On formulations of the stochastic uncapacitated lot-sizing problem. Oper. Res. Lett. 34 (3) (2006)
Andrew J. Schaefer, George L. Nemhauser
Improving airline operational performance through schedule perturbation. Ann. Oper. Res. 144 (1) (2006)
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) (2006)
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) (2006)
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) (2006)
Dieter Vandenbussche, George L. Nemhauser
The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9 (4) (2005)
Andrew J. Schaefer, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser
Airline Crew Scheduling Under Uncertainty. Transp. Sci. 39 (3) (2005)
Dieter Vandenbussche, George L. Nemhauser
A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102 (3) (2005)
Dieter Vandenbussche, George L. Nemhauser
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102 (3) (2005)
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
Sequential Pairing of Mixed Integer Inequalities. IPCO (2005)
Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles. Transp. Sci. 38 (3) (2004)
Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser
Models for representing piecewise linear cost functions. Oper. Res. Lett. 32 (1) (2004)
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) (2003)
Ismael R. de Farias Jr., George L. Nemhauser
A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96 (3) (2003)
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) (2003)
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) (2003)
Jay M. Rosenberger, Ellis L. Johnson, George L. Nemhauser
Rerouting Aircraft for Airline Recovery. Transp. Sci. 37 (4) (2003)
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) (2003)
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) (2003)
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) (2002)
Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser
Facets of the Complementarity Knapsack Polytope. Math. Oper. Res. 27 (1) (2002)
Jeff Day, George L. Nemhauser, Joel S. Sokol
Management of Railroad Impedances for Shortest Path-based Routing. Electron. Notes Theor. Comput. Sci. 66 (6) (2002)
Ismael R. de Farias Jr., George L. Nemhauser
A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO (2002)
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) (2002)
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)
Kelly Easton, George L. Nemhauser, Michael A. Trick
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. PATAT (2002)
Diego Klabjan, George L. Nemhauser
A Polyhedral Study of Integer Variable Upper Bounds. Math. Oper. Res. 27 (4) (2002)
Kelly Easton, George L. Nemhauser, Michael A. Trick
The Traveling Tournament Problem Description and Benchmarks. CP (2001)

George L. Nemhauser.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

George L. Nemhauser