George Nemhauser
44 catalog papers. Identity-linked publications and additional name matches are distinguished below.
OpenAlex: A5057281816
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Publications
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems — INFORMS Journal on Computing 2022
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems — INFORMS Journal on Computing 2022
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting — INFORMS Journal on Computing 2021
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing — INFORMS Journal on Computing 2014
- Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem — INFORMS Journal on Computing 2013
- A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing — Operations Research 2012
- The Fixed-Charge Shortest-Path Problem — INFORMS Journal on Computing 2012
- Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem — INFORMS Journal on Computing 2011
- Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study — INFORMS Journal on Computing 2011
- A Note on “A Superior Representation Method for Piecewise Linear Functions” — INFORMS Journal on Computing 2010
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions — Operations Research 2010
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem — INFORMS Journal on Computing 2010
- Cutting Planes for Multistage Stochastic Integer Programs — Operations Research 2009
- Strategic Planning with Start-Time Dependent Variable Costs — Operations Research 2009
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs — INFORMS Journal on Computing 2008
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization — Operations Research 2006
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure — Operations Research 2000
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition — INFORMS Journal on Computing 2000
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity — INFORMS Journal on Computing 1999
- Allocating Fibers in Cable Manufacturing — Manufacturing & Service Operations Management 1999
- Price-Directed Control of Remnant Inventory Systems — Operations Research 1999
- Lifted Cover Inequalities for 0-1 Integer Programs: Computation — INFORMS Journal on Computing 1998
- An Optimization Based Heuristic for Political Districting — Management Science 1998
- Branch-and-Price: Column Generation for Solving Huge Integer Programs — Operations Research 1998
- Scheduling A Major College Basketball Conference — Operations Research 1998
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm — Operations Research 1997
- The Age of Optimization: Solving Large-Scale Real-World Problems — Operations Research 1994
- Formulating a Mixed Integer Programming Problem to Improve Solvability — Operations Research 1993
- Some Facets for an Assignment Problem with Side Constraints — Operations Research 1991
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem — Operations Research 1980
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit — Operations Research 1979
- Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” — Management Science 1979
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms — Management Science 1977
- A Problem in Bulk Service Scheduling — Operations Research 1972
- A Modified Linear Program for Columnar Methods in Mathematical Programming — Operations Research 1971
- Discrete Dynamic Programming and Capital Allocation — Management Science 1969
- The Traveling Salesman Problem: A Survey — Operations Research 1968
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem — Operations Research 1968
- Scheduling to Minimize Interaction Cost — Operations Research 1966
- A Quantitative Approach to Employment Planning — Management Science 1965
- Letter to the Editor—Acknowledgment — Operations Research 1964
- An Algorithm for the Line Balancing Problem — Management Science 1964
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem — Operations Research 1963
- On the Relation Between the Traveling-Salesman and the Longest-Path Problems — Operations Research 1962