Scheduling to Minimize Interaction Cost. - R. C. Carlson; George L. Nemhauser (Oper. Res., 1966)

A Transport Improvement Problem Transformable to a Best-Path Problem. - Alan J. Goldman; George L. Nemhauser (Transp. Sci., 1967)

Computer construction of project networks. - A. C. Fisher; J. S. Liebman; George L. Nemhauser (Commun. ACM, 1968)

The Traveling Salesman Problem: A Survey. - Mandell Bellmore; George L. Nemhauser (Oper. Res., 1968)

Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem. - George L. Nemhauser; Zev Ullmann (Oper. Res., 1968)

The Set-Partitioning Problem: Set Covering with Equality Constraints. - Robert S. Garfinkel; George L. Nemhauser (Oper. Res., 1969)

A Modified Linear Program for Columnar Methods in Mathematical Programming. - George L. Nemhauser; William B. Widhelm (Oper. Res., 1971)

A Problem in Bulk Service Scheduling. - George L. Nemhauser; P. L. Yu (Oper. Res., 1972)

Book reviews. - George L. Nemhauser; A. C. Williams; Sanjoy K. Mitter; Joseph T. Howson (Math. Program., 1973)

Some inequalities on the chromatic number of a graph. - T. King; George L. Nemhauser (Discret. Math., 1974)

Properties of vertex packing and independence system polyhedra. - George L. Nemhauser; Leslie E. Trotter Jr. (Math. Program., 1974)

When the Greedy Solution Solves a Class of Knapsack Problems. - Michael J. Magazine; George L. Nemhauser; Leslie E. Trotter Jr. (Oper. Res., 1975)

Vertex packings: Structural properties and algorithms. - George L. Nemhauser; Leslie E. Trotter Jr. (Math. Program., 1975)

Best Algorithms for Approximating the Maximum of a Submodular Set Function. - George L. Nemhauser; Laurence A. Wolsey (Math. Oper. Res., 1978)

Tight bounds for christofides' traveling salesman heuristic. - Gérard Cornuéjols; George L. Nemhauser (Math. Program., 1978)

An analysis of approximations for maximizing submodular set functions - I. - George L. Nemhauser; Laurence A. Wolsey; Marshall L. Fisher (Math. Program., 1978)

Easy and hard bottleneck location problems. - Wen-Lian Hsu; George L. Nemhauser (Discret. Appl. Math., 1979)

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. - Marshall L. Fisher; George L. Nemhauser; Laurence A. Wolsey (Oper. Res., 1979)

Matroids and a Reliability Analysis Problem. - Michael O. Ball; George L. Nemhauser (Math. Oper. Res., 1979)

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. - Gérard Cornuéjols; George L. Nemhauser; Laurence A. Wolsey (Oper. Res., 1980)

A Canonical Representation of Simple Plant Location Problems and Its Applications. - Gérard Cornuéjols; George L. Nemhauser; Laurence A. Wolsey (SIAM J. Algebraic Discret. Methods, 1980)

Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. - Wen-Lian Hsu; George L. Nemhauser (Discret. Math., 1981)

A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. - Wen-Lian Hsu; Yoshiro Ikura; George L. Nemhauser (Math. Program., 1981)

An application of vertex packing to data analysis in the evaluation of pavement deterioration. - Eliane A. Gattass; George L. Nemhauser (Oper. Res. Lett., 1981)

Editorial. - George L. Nemhauser (Oper. Res. Lett., 1981)

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. - Wen-Lian Hsu; George L. Nemhauser (Discret. Math., 1982)

R-domination on block graphs. - Gerard J. Chang; George L. Nemhauser (Oper. Res. Lett., 1982)

A polynomial algorithm for the max-cut problem on graphs without long odd cycles. - Martin Grötschel; George L. Nemhauser (Math. Program., 1984)

Simplex pivots on the set packing polytope. - Yoshiro Ikura; George L. Nemhauser (Math. Program., 1985)

Computational experience with a polynomial-time dual simplex algorithm for the transportation problem. - Yoshiro Ikura; George L. Nemhauser (Discret. Appl. Math., 1986)

Integer and Combinatorial Optimization. - George L. Nemhauser; Laurence A. Wolsey (Wiley, 1988)

A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs. - George L. Nemhauser; Laurence A. Wolsey (Math. Program., 1990)

Some Facets for an Assignment Problem with Side Constraints. - Ronny Aboudi; George L. Nemhauser (Oper. Res., 1991)

A polyhedral approach to edge coloring. - George L. Nemhauser; Sungsoo Park (Oper. Res. Lett., 1991)

Recent Developments and Future Directions in Mathematical Programming. - Ellis L. Johnson; George L. Nemhauser (IBM Syst. J., 1992)

Formulating a Mixed Integer Programming Problem to Improve Solvability. - Cynthia Barnhart; Ellis L. Johnson; George L. Nemhauser; Gabriele Sigismondi; Pamela H. Vance (Oper. Res., 1993)

Min-cut clustering. - Ellis L. Johnson; Anuj Mehrotra; George L. Nemhauser (Math. Program., 1993)

Experiments with parallel branch-and-bound algorithms for the set covering problem. - Russell A. Rushmeier; George L. Nemhauser (Oper. Res. Lett., 1993)

Solving binary cutting stock problems by column generation and branch-and-bound. - Pamela H. Vance; Cynthia Barnhart; Ellis L. Johnson; George L. Nemhauser (Comput. Optim. Appl., 1994)

The Age of Optimization: Solving Large-Scale Real-World Problems. - George L. Nemhauser (Oper. Res., 1994)

Some properties of the fleet assignment problem. - Zonghao Gu; Ellis L. Johnson; George L. Nemhauser; Wang Yinhua (Oper. Res. Lett., 1994)

MINTO, a mixed INTeger optimizer. - George L. Nemhauser; Martin W. P. Savelsbergh; Gabriele Sigismondi (Oper. Res. Lett., 1994)

Lifted cover facets of the 0-1 knapsack polytope with GUB constraints. - George L. Nemhauser; Pamela H. Vance (Oper. Res. Lett., 1994)

One-machine generalized precedence constrained scheduling problems. - Erick D. Wikum; Donna Crystal Llewellyn; George L. Nemhauser (Oper. Res. Lett., 1994)

Sequence Independent Lifting of Cover Inequalities. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (IPCO, 1995)

The fleet assignment problem: Solving a large-scale integer program. - Christopher A. Hane; Cynthia Barnhart; Ellis L. Johnson; Roy E. Marsten; George L. Nemhauser; Gabriele Sigismondi (Math. Program., 1995)

Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). - George L. Nemhauser (CP, 1996)

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (J. Heuristics, 1996)

Maintenance and Crew Considerations in Fleet Assignment. - Lloyd W. Clarke; Christopher A. Hane; Ellis L. Johnson; George L. Nemhauser (Transp. Sci., 1996)

The aircraft rotation problem. - Lloyd W. Clarke; Ellis L. Johnson; George L. Nemhauser; Zhongxi Zhu (Ann. Oper. Res., 1997)

Airline Crew Scheduling: A New Formulation and Decomposition Algorithm. - Pamela H. Vance; Cynthia Barnhart; Ellis L. Johnson; George L. Nemhauser (Oper. Res., 1997)

Polyhedral Characterizations, Perfection of Line Graphs. - Dasong Cao; George L. Nemhauser (Discret. Appl. Math., 1998)

Lifted Cover Inequalities for 0-1 Integer Programs: Computation. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 1998)

Branch-and-Price: Column Generation for Solving Huge Integer Programs. - Cynthia Barnhart; Ellis L. Johnson; George L. Nemhauser; Martin W. P. Savelsbergh; Pamela H. Vance (Oper. Res., 1998)

Scheduling A Major College Basketball Conference. - George L. Nemhauser; Michael A. Trick (Oper. Res., 1998)

The complexity of cover inequality separation. - Diego Klabjan; George L. Nemhauser; Craig A. Tovey (Oper. Res. Lett., 1998)

Flight String Models for Aircraft Fleeting and Routing. - Cynthia Barnhart; Natashia L. Boland; Lloyd W. Clarke; Ellis L. Johnson; George L. Nemhauser; Rajesh G. Shenoi (Transp. Sci., 1998)

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 1999)

Price-Directed Control of Remnant Inventory Systems. - Daniel Adelman; George L. Nemhauser (Oper. Res., 1999)

Lifted flow cover inequalities for mixed 0-1 integer programs. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 1999)

Allocating Fibers in Cable Manufacturing. - Daniel Adelman; George L. Nemhauser; Mario Padron; Robert Stubbs; Ram Pandit (Manuf. Serv. Oper. Manag., 1999)

Air transportation simulation: SimAir: a stochastic model of airline operations. - Jay M. Rosenberger; Andrew J. Schaefer; David Goldsman; Ellis L. Johnson; Anton J. Kleywegt; George L. Nemhauser (WSC, 2000)

Conflict graphs in solving integer programming problems. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2000)

The asymmetric traveling salesman problem with replenishment arcs. - Natashia L. Boland; Lloyd W. Clarke; George L. Nemhauser (Eur. J. Oper. Res., 2000)

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Eur. J. Oper. Res., 2000)

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. - Ellis L. Johnson; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2000)

A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure. - Gregory D. Glockner; George L. Nemhauser (Oper. Res., 2000)

Sequence Independent Lifting in Mixed Integer Programming. - Zonghao Gu; George L. Nemhauser; Martin W. P. Savelsbergh (J. Comb. Optim., 2000)

The mixed vertex packing problem. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2000)

A generalized assignment problem with special ordered sets: a polyhedral approach. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Math. Program., 2000)

A parallel primal-dual simplex algorithm. - Diego Klabjan; Ellis L. Johnson; George L. Nemhauser (Oper. Res. Lett., 2000)

Airline Crew Recovery. - Ladislav Lettovsky; Ellis L. Johnson; George L. Nemhauser (Transp. Sci., 2000)

A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Combinatorial Optimization, 2001)

The Traveling Tournament Problem Description and Benchmarks. - Kelly Easton; George L. Nemhauser; Michael A. Trick (CP, 2001)

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (IPCO, 2001)

Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results. - Gregory D. Glockner; George L. Nemhauser; Craig A. Tovey (Comput. Optim. Appl., 2001)

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching. - Diego Klabjan; Ellis L. Johnson; George L. Nemhauser; Eric Gelman; Srini Ramaswamy (Comput. Optim. Appl., 2001)

Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Knowl. Eng. Rev., 2001)

Valid inequalities for problems with additive variable upper bounds. - Alper Atamtürk; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2001)

A family of inequalities for the generalized assignment polytope. - Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res. Lett., 2001)

Airline Crew Scheduling with Regularity. - Diego Klabjan; Ellis L. Johnson; George L. Nemhauser; Eric Gelman; Srini Ramaswamy (Transp. Sci., 2001)

Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. - Kelly Easton; George L. Nemhauser; Michael A. Trick (PATAT, 2002)

Management of Railroad Impedances for Shortest Path-based Routing. - Jeff Day; George L. Nemhauser; Joel S. Sokol (ATMOS, 2002)

Facets of the Complementarity Knapsack Polytope. - Ismael R. de Farias Jr.; Ellis L. Johnson; George L. Nemhauser (Math. Oper. Res., 2002)

A Polyhedral Study of Integer Variable Upper Bounds. - Diego Klabjan; George L. Nemhauser (Math. Oper. Res., 2002)

Airline Crew Scheduling with Time Windows and Plane-Count Constraints. - Diego Klabjan; Ellis L. Johnson; George L. Nemhauser; Eric Gelman; Srini Ramaswamy (Transp. Sci., 2002)

A Stochastic Model of Airline Operations. - Jay M. Rosenberger; Andrew J. Schaefer; David Goldsman; Ellis L. Johnson; Anton J. Kleywegt; George L. Nemhauser (Transp. Sci., 2002)

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study. - Bram Verweij; Shabbir Ahmed 001; Anton J. Kleywegt; George L. Nemhauser; Alexander Shapiro 001 (Comput. Optim. Appl., 2003)

A polyhedral study of the cardinality constrained knapsack problem. - Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2003)

On the polyhedral structure of a multi-item production planning model with setup times. - Andrew J. Miller; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program., 2003)

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. - Jean-Philippe P. Richard; Ismael R. de Farias Jr.; George L. Nemhauser (Math. Program., 2003)

Rerouting Aircraft for Airline Recovery. - Jay M. Rosenberger; Ellis L. Johnson; George L. Nemhauser (Transp. Sci., 2003)

Models for representing piecewise linear cost functions. - Ahmet B. Keha; Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res. Lett., 2004)

A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles. - Jay M. Rosenberger; Ellis L. Johnson; George L. Nemhauser (Transp. Sci., 2004)

Sports Scheduling. - Kelly Easton; George L. Nemhauser; Michael A. Trick (Handbook of Scheduling, 2004)

The 2-Edge-Connected Subgraph Polyhedron. - Dieter Vandenbussche; George L. Nemhauser (J. Comb. Optim., 2005)

A polyhedral study of nonconvex quadratic programs with box constraints. - Dieter Vandenbussche; George L. Nemhauser (Math. Program., 2005)

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. - Dieter Vandenbussche; George L. Nemhauser (Math. Program., 2005)

Airline Crew Scheduling Under Uncertainty. - Andrew J. Schaefer; Ellis L. Johnson; Anton J. Kleywegt; George L. Nemhauser (Transp. Sci., 2005)

Improving airline operational performance through schedule perturbation. - Andrew J. Schaefer; George L. Nemhauser (Ann. Oper. Res., 2006)

An optimization approach for planning daily drayage operations. - Yetkin Ileri; Mokhtar S. Bazaraa; Ted Gifford; George L. Nemhauser; Joel S. Sokol; Erick D. Wikum (Central Eur. J. Oper. Res., 2006)

Short-term booking of air cargo space. - Ek Peng Chew; Huei Chuen Huang; Ellis L. Johnson; George L. Nemhauser; Joel S. Sokol; Chun How Leong (Eur. J. Oper. Res., 2006)

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. - Ahmet B. Keha; Ismael R. de Farias Jr.; George L. Nemhauser (Oper. Res., 2006)

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser; Andrew J. Miller (Math. Program., 2006)

On formulations of the stochastic uncapacitated lot-sizing problem. - Yongpei Guan; Shabbir Ahmed 001; Andrew J. Miller; George L. Nemhauser (Oper. Res. Lett., 2006)

Chapter 1 Air Transportation: Irregular Operations and Control. - Michael O. Ball; Cynthia Barnhart; George L. Nemhauser; Amedeo R. Odoni (Transportation, 2007)

Hooked on IP. - George L. Nemhauser (Ann. Oper. Res., 2007)

Analysis of bounds for a capacitated single-item lot-sizing problem. - Jill R. Hardin; George L. Nemhauser; Martin W. P. Savelsbergh (Comput. Oper. Res., 2007)

Sequential pairing of mixed integer inequalities. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser (Discret. Optim., 2007)

George Dantzig's contributions to integer programming. - Martin Grötschel; George L. Nemhauser (Discret. Optim., 2008)

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements. - Jill R. Hardin; George L. Nemhauser; Martin W. P. Savelsbergh (Discret. Optim., 2008)

Nonconvex, lower semicontinuous piecewise linear optimization. - Juan Pablo Vielma; Ahmet B. Keha; George L. Nemhauser (Discret. Optim., 2008)

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2008)

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Using Branch-and-Price to Find High Quality Solutions Quickly. - George L. Nemhauser; Mike Hewitt; Martin W. P. Savelsbergh (Models and Algorithms for Optimization in Logistics, 2009)

Cutting Planes for Multistage Stochastic Integer Programs. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res., 2009)

Strategic Planning with Start-Time Dependent Variable Costs. - James R. Luedtke; George L. Nemhauser (Oper. Res., 2009)

Information-based branching schemes for binary linear mixed integer problems. - Fatma Kilinç-Karzan; George L. Nemhauser; Martin W. P. Savelsbergh (Math. Program. Comput., 2009)

Approximating the stability region for binary mixed-integer programs. - Fatma Kilinç-Karzan; Alejandro Toriello; Shabbir Ahmed 001; George L. Nemhauser; Martin W. P. Savelsbergh (Oper. Res. Lett., 2009)

Automated Channel Abstraction for Advertising Auctions. - William E. Walsh; Craig Boutilier; Tuomas Sandholm; Rob Shields; George L. Nemhauser; David C. Parkes (AAAI, 2010)

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2010)

A Note on "A Superior Representation Method for Piecewise Linear Functions". - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2010)

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res., 2010)

An integer programming approach for linear programs with probabilistic constraints. - James R. Luedtke; Shabbir Ahmed 001; George L. Nemhauser (Math. Program., 2010)

Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation. - Gizem Keysan; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2010)

Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem. - Faramroze G. Engineer; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2011)

Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study. - Amar Kumar Narisetty; Jean-Philippe P. Richard; George L. Nemhauser (INFORMS J. Comput., 2011)

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. - Juan Pablo Vielma; George L. Nemhauser (Math. Program., 2011)

A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (SIAM J. Optim., 2011)

Branch-and-Price Guided Search - (Extended Abstract). - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (ISCO, 2012)

Pricing for production and delivery flexibility in single-item lot-sizing. - Yaxian Li; George L. Nemhauser; Martin W. P. Savelsbergh (Comput. Oper. Res., 2012)

The Fixed-Charge Shortest-Path Problem. - Faramroze G. Engineer; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (INFORMS J. Comput., 2012)

A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing. - Faramroze G. Engineer; Kevin C. Furman; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (Oper. Res., 2012)

Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res. Lett., 2012)

The value function of an infinite-horizon single-item lot-sizing problem. - Alejandro Toriello; George L. Nemhauser (Oper. Res. Lett., 2012)

Mixed integer linear programming formulations for probabilistic constraints. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res. Lett., 2012)

Fixed-Charge Transportation with Product Blending. - Dimitri J. Papageorgiou; Alejandro Toriello; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2012)

A branch-and-price guided search approach to maritime inventory routing. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song (Comput. Oper. Res., 2013)

Restrict-and-relax search for 0-1 mixed-integer programs. - Menal Guzelsoy; George L. Nemhauser; Martin W. P. Savelsbergh (EURO J. Comput. Optim., 2013)

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. - Mike Hewitt; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2013)

Congestion-aware dynamic routing in automated material handling systems. - Kelly Bartlett; Junho Lee; Shabbir Ahmed 001; George L. Nemhauser; Joel S. Sokol; Byungsoo Na (Comput. Ind. Eng., 2014)

MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. - Dimitri J. Papageorgiou; George L. Nemhauser; Joel S. Sokol; Myun-Seok Cheon; Ahmet B. Keha (Eur. J. Oper. Res., 2014)

Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing. - Dimitri J. Papageorgiou; Ahmet B. Keha; George L. Nemhauser; Joel S. Sokol (INFORMS J. Comput., 2014)

Using diversification, communication and parallelism to solve mixed-integer linear programs. - Rodolfo Carvajal; Shabbir Ahmed 001; George L. Nemhauser; Kevin C. Furman; Vikas Goel; Yufen Shao (Oper. Res. Lett., 2014)

A cutting and scheduling problem in float glass manufacturing. - Byungsoo Na; Shabbir Ahmed 001; George L. Nemhauser; Joel S. Sokol (J. Sched., 2014)

Minimum concave cost flow over a grid network. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (Math. Program., 2015)

How important are branching decisions: Fooling MIP solvers. - Pierre Le Bodic; George L. Nemhauser (Oper. Res. Lett., 2015)

A dual heuristic for mixed integer programming. - Yaxian Li; Özlem Ergun; George L. Nemhauser (Oper. Res. Lett., 2015)

Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems. - Dimitri J. Papageorgiou; Myun-Seok Cheon; George L. Nemhauser; Joel Sokol (Transp. Sci., 2015)

Learning to Branch in Mixed Integer Programming. - Elias Boutros Khalil; Pierre Le Bodic; Le Song; George L. Nemhauser; Bistra Dilkina (AAAI, 2016)

On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. - Shabbir Ahmed 001; Qie He; Shi Li 001; George L. Nemhauser (SIAM J. Optim., 2016)

Estimating the size of search trees by sampling with domain knowledge. - Gleb Belov; Samuel Esler; Dylan Fernando; Pierre Le Bodic; George L. Nemhauser (IJCAI, 2017)

Learning to Run Heuristics in Tree Search. - Elias B. Khalil; Bistra Dilkina; George L. Nemhauser; Shabbir Ahmed 001; Yufen Shao (IJCAI, 2017)

A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Vikas Goel; Yufen Shao (Comput. Oper. Res., 2017)

A hybrid primal heuristic for finding feasible solutions to mixed integer programs. - Carlos Eduardo de Andrade; Shabbir Ahmed 001; George L. Nemhauser; Yufen Shao (Eur. J. Oper. Res., 2017)

An abstract model for branching and its application to mixed integer programming. - Pierre Le Bodic; George L. Nemhauser (Math. Program., 2017)

Erratum to: An abstract model for branching and its application to mixed integer programming. - Pierre Le Bodic; George L. Nemhauser (Math. Program., 2017)

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (CPAIOR, 2018)

Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Yufen Shao (Comput. Optim. Appl., 2018)

Flexible solutions to maritime inventory routing problems with delivery time windows. - Chengliang Zhang; George L. Nemhauser; Joel Sokol; Myun-Seok Cheon; Ahmet B. Keha (Comput. Oper. Res., 2018)

Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation. - Matías Siebert; Kelly Bartlett; Haejoong Kim; Shabbir Ahmed 001; Junho Lee; Dima Nazzal; George L. Nemhauser; Joel Sokol (Int. J. Prod. Res., 2018)

Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Yufen Shao; Dimitri J. Papageorgiou (Comput. Oper. Res., 2019)

A Simulated Annealing Algorithm for the Directed Steiner Tree Problem. - Matías Siebert; Shabbir Ahmed 001; George L. Nemhauser (CoRR, 2020)

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint. - Ezgi Karabulut; Shabbir Ahmed 001; George L. Nemhauser (Discret. Optim., 2020)

A linear programming based approach to the Steiner tree problem with a fixed number of terminals. - Matías Siebert; Shabbir Ahmed 001; George L. Nemhauser (Networks, 2020)

Decentralized online integer programming problems with a coupling cardinality constraint. - Ezgi Karabulut; Shabbir Ahmed 001; George L. Nemhauser (Comput. Oper. Res., 2021)

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2021)

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems. - Hossein Hashemi Doulabi; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2022)

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems. - Edward Yuhang He; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (INFORMS J. Comput., 2022)

Decomposition of loosely coupled integer programs: a multiobjective perspective. - Merve Bodur; Shabbir Ahmed 001; Natashia Boland; George L. Nemhauser (Math. Program., 2022)

An exact algorithm for the service network design problem with hub capacity constraints. - Edward He 001; Natashia Boland; George L. Nemhauser; Martin W. P. Savelsbergh (Networks, 2022)

Distributionally robust disaster relief planning under the Wasserstein set. - Mohamed El Tonbari; George L. Nemhauser; Alejandro Toriello (Comput. Oper. Res., 2024)