George Nemhauser | Academic Influence

George Nemhauser's AcademicInfluence.com Rankings

George Nemhauser

Engineering

#839

World Rank

#1316

Historical Rank

#355

USA Rank

Industrial Engineering

#3

World Rank

#4

Historical Rank

#1

USA Rank

engineering Degrees

George Nemhauser

Mathematics

#1074

World Rank

#1832

Historical Rank

#468

USA Rank

Operations Research

#5

World Rank

#5

Historical Rank

#5

USA Rank

Measure Theory

#231

World Rank

#362

Historical Rank

#104

USA Rank

mathematics Degrees

Download Badge

Engineering
Mathematics

George Nemhauser's Degrees

Bachelors Industrial Engineering Georgia Tech

Why Is George Nemhauser Influential?

(Suggest an Edit or Addition)

According to Wikipedia, George Lann Nemhauser is an American operations researcher, the A. Russell Chandler III Chair and Institute Professor of Industrial and Systems Engineering at the Georgia Institute of Technology and the former president of the Operations Research Society of America.

(See a Problem?)

George Nemhauser's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Integer and Combinatorial Optimization (1988) (5263)
Integer Programming (2020) (4511)
An analysis of approximations for maximizing submodular set functions—I (1978) (4372)
Handbooks in operations research and management science (1989) (2299)
Branch-and-Price: Column Generation for Solving Huge Integer Programs (1998) (2265)
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977) (760)
Vertex packings: Structural properties and algorithms (1975) (689)
A Model and an Algorithm for the Dynamic Traffic Assignment Problems (1978) (637)
Best Algorithms for Approximating the Maximum of a Submodular Set Function (1978) (564)
The uncapacitated facility location problem (1990) (560)
Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" (1979) (517)
The Traveling Salesman Problem: A Survey (1968) (513)
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study (2003) (452)
The fleet assignment problem: Solving a large-scale integer program (1995) (432)
Introduction To Dynamic Programming (1966) (422)
An integer programming approach for linear programs with probabilistic constraints (2007) (373)
Flight String Models for Aircraft Fleeting and Routing (1998) (363)
Optimality Conditions for a Dynamic Traffic Assignment Model (1978) (349)
Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions (2010) (340)
Properties of vertex packing and independence system polyhedra (1974) (320)
Optimal Political Districting by Implicit Enumeration Techniques (1970) (306)
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (2008) (292)
An Optimization Based Heuristic for Political Districting (1998) (275)
An Algorithm for the Line Balancing Problem (1964) (253)
Airline Crew Scheduling (2003) (246)
Learning to Branch in Mixed Integer Programming (2016) (243)
MINTO, a mixed INTeger optimizer (1994) (240)
Solving binary cutting stock problems by column generation and branch-and-bound (1994) (240)
The Traveling Tournament Problem Description and Benchmarks (2001) (239)
Min-cut clustering (1993) (237)
Discrete Dynamic Programming and Capital Allocation (1969) (233)
A recursive procedure to generate all cuts for 0–1 mixed integer programs (1990) (227)
Easy and hard bottleneck location problems (1979) (225)
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm (1997) (218)
Dynamic programming applied to unequally spaced arrays (1964) (217)
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (2000) (212)
Rerouting Aircraft for Airline Recovery (2003) (211)
The aircraft rotation problem (1997) (207)
Maintenance and Crew Considerations in Fleet Assignment (1996) (190)
The Set-Partitioning Problem: Set Covering with Equality Constraints (1969) (181)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2014) (178)
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (1999) (174)
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs (1984) (172)
Air Transportation: Irregular Operations and Control (2007) (171)
Airline Crew Scheduling Under Uncertainty (2005) (171)
Lifted Cover Inequalities for 0-1 Integer Programs: Computation (1998) (169)
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs (2008) (167)
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach (2002) (161)
Conflict graphs in solving integer programming problems (2000) (161)
Models for representing piecewise linear cost functions (2004) (159)
A Stochastic Model of Airline Operations (2002) (156)
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (1992) (153)
Airline Crew Scheduling with Time Windows and Plane-Count Constraints (2002) (153)
Lifted flow cover inequalities for mixed 0-1 integer programs (1999) (152)
Airline Crew Recovery (2000) (148)
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles (2004) (145)
Scheduling A Major College Basketball Conference (1998) (144)
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem (2010) (137)
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (2005) (136)
On the Uncapacitated Location Problem (1977) (134)
A Column Generation Algorithm for Optimal Traffic Assignment (1973) (133)
Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* (1981) (130)
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching (2001) (116)
Operations Research Letters (2011) (109)
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems (1974) (104)
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (2006) (103)
Learning to Run Heuristics in Tree Search (2017) (98)
Sequence Independent Lifting in Mixed Integer Programming (2000) (98)
Chapter 1 Air Transportation: Irregular Operations and Control (2007) (91)
MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results (2014) (89)
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (2006) (89)
Functional description of MINTO : a mixed integer optimizer (1991) (89)
When the Greedy Solution Solves a Class of Knapsack Problems (1975) (88)
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (1979) (88)
The mixed vertex packing problem (2000) (82)
Constraint classification for mixed integer programming formulations (1991) (80)
Scheduling to Minimize Interaction Cost (1966) (74)
One-machine generalized precedence constrained scheduling problems (1994) (73)
A polyhedral approach to edge coloring (1991) (72)
The Age of Optimization: Solving Large-Scale Real-World Problems (1994) (72)
A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure (2000) (71)
A polyhedral study of nonconvex quadratic programs with box constraints (2005) (69)
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing (2012) (69)
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (1996) (68)
A Geometric Model and a Graphical Algorithm for a Sequencing Problem (1963) (66)
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model (2008) (64)
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables (2001) (63)
BRANCH-AND-PRICE: GENERATION FOR SOLVING HUGE INTEGER PROGRAMS (1998) (61)
Information-based branching schemes for binary linear mixed integer problems (2009) (61)
An optimization approach for planning daily drayage operations (2006) (60)
Some properties of the fleet assignment problem (1994) (60)
A polyhedral study of the cardinality constrained knapsack problem (2002) (60)
Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut (2000) (59)
On the polyhedral structure of a multi–item production planning model with setup times (2003) (59)
Cutting Planes for Multistage Stochastic Integer Programs (2009) (58)
Airline Crew Scheduling with Regularity (2001) (58)
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (1994) (58)
A Heuristic Branch-and-Price Approach for the Airline Crew Pairing Problem (1997) (57)
Tight bounds for christofides' traveling salesman heuristic (1978) (57)
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (2002) (55)
A Canonical Representation of Simple Plant Location Problems and Its Applications (1980) (53)
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (1980) (51)
A generalized assignment problem with special ordered sets: a polyhedral approach (2000) (51)
Nonconvex, lower semicontinuous piecewise linear optimization (2008) (50)
Congestion-aware dynamic routing in automated material handling systems (2014) (49)
The asymmetric traveling salesman problem with replenishment arcs (2000) (49)
Sports Scheduling (2004) (47)
On the Relation Between the Traveling-Salesman and the Longest-Path Problems (1962) (46)
Matroids and a Reliability Analysis Problem (1979) (45)
A generalized permanent label setting algorithm for the shortest path between specified nodes (1972) (44)
Branch-and-bound and parallel computation: A historical note (1988) (43)
Heuristic Optimization: A hybrid AI/OR approach (1997) (43)
Facets of the Complementarity Knapsack Polytope (2002) (43)
On formulations of the stochastic uncapacitated lot-sizing problem (2006) (41)
A branch-and-price guided search approach to maritime inventory routing (2013) (41)
Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems (2015) (40)
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search (2008) (40)
Short-term booking of air cargo space (2006) (40)
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (1981) (40)
Formulating a Mixed Integer Programming Problem to Improve Solvability (1993) (39)
A polynomial algorithm for the max-cut problem on graphs without long odd cycles (1984) (38)
SimAir: a stochastic model of airline operations (2000) (38)
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case☆ (1996) (37)
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (2000) (37)
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting (2003) (37)
The complexity of cover inequality separation (1998) (36)
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case (2003) (35)
Sequential pairing of mixed integer inequalities (2005) (34)
The Uncapicitated Facility Location Problem (1983) (33)
Decomposing inventory routing problems with approximate value functions (2010) (32)
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing (2014) (32)
A Modified Linear Program for Columnar Methods in Mathematical Programming (1971) (31)
Valid inequalities for problems with additive variable upper bounds (1999) (31)
Experiments with parallel branch-and-bound algorithms for the set covering problem (1993) (31)
Optimization of multistage cyclic and braching systems by serial procedures (1964) (30)
A parallel primal-dual simplex algorithm (2000) (30)
Flexible solutions to maritime inventory routing problems with delivery time windows (2018) (30)
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times (1992) (30)
An abstract model for branching and its application to mixed integer programming (2015) (29)
Optimal set partitioning, matchings and lagrangian duality (1979) (29)
Fixed-Charge Transportation with Product Blending (2012) (28)
Scheduling Local and Express Service (1969) (27)
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem (2013) (27)
A family of inequalities for the generalized assignment polytope (2001) (25)
Integer Programming: the Global Impact (2013) (25)
Automated Channel Abstraction for Advertising Auctions (2010) (24)
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (2008) (24)
Price-Directed Control of Remnant Inventory Systems (1999) (24)
Column Generation for Linear and Integer Programming (2012) (24)
Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem (1968) (23)
Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs (1981) (23)
Mixed integer linear programming formulations for probabilistic constraints (2012) (22)
Using diversification, communication and parallelism to solve mixed-integer linear programs (2014) (22)
A finiteness proof for modified dantzig cuts in integer programming (1970) (22)
Chapter VI Integer programming (1989) (21)
George Dantzig's contributions to integer programming (2008) (21)
Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing (2018) (21)
A Note on "A Superior Representation Method for Piecewise Linear Functions" (2010) (20)
Minimum concave cost flow over a grid network (2015) (19)
Some Facets for an Assignment Problem with Side Constraints (1991) (19)
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (2018) (19)
Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem (2011) (19)
For the Common Good? New Zealanders Comply with Quality Standards (1998) (19)
Computer construction of project networks (1968) (19)
Conflict Graphs in Integer Programming (1998) (19)
Restrict-and-relax search for 0-1 mixed-integer programs (2013) (18)
Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation (2010) (18)
Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results (2001) (18)
Polyhedral Characterizations, Perfection of Line Graphs (1998) (17)
R-domination on block graphs (1982) (17)
The Scope of Integer and Combinatorial Optimization (2014) (17)
Robust Airline Crew Scheduling (2001) (17)
Covering, Packing and Generalized Perfection (1985) (17)
A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs (2011) (17)
Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation (2018) (16)
Recent Developments and Future Directions in Mathematical Programming (1992) (16)
A hybrid primal heuristic for finding feasible solutions to mixed integer programs (2017) (16)
Finding an Optimal Stationing Policy for the US Army in Europe After the Force Drawdown (1996) (15)
Approximating the stability region for binary mixed-integer programs (2009) (15)
A Transport Improvement Problem Transformable to a Best-Path Problem (1967) (15)
A Survey of Integer Programming Emphasizing Computation and Relations among Models (1973) (15)
Optimization theory for large systems (1972) (15)
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem (2017) (14)
Decomposition of linear programs by dynamic programming (1964) (14)
A Problem in Bulk Service Scheduling (1972) (14)
Perspectives on optimization : a collection of expository articles (1972) (14)
Set Partitioning and Chain Decomposition (1974) (13)
Simplex pivots on the set packing polytope (1985) (13)
Analysis of bounds for a capacitated single-item lot-sizing problem (2007) (13)
Handbook Of Discrete Optimization (2005) (13)
Sequence Independent Lifting of Cover Inequalities (1995) (12)
A linear programming based approach to the Steiner tree problem with a fixed number of terminals (2018) (12)
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (2021) (11)
Improving airline operational performance through schedule perturbation (2006) (11)
Management of Railroad Impedances for Shortest Path-based Routing (2002) (11)
Air transportation simulation: SimAir: a stochastic model of airline operations (2000) (11)
A Quantitative Approach to Employment Planning (1965) (10)
An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs (1982) (10)
A polyhedral approach to combinatorial complementarity programming problems (1995) (10)
CP Based Branch-and-Price (2004) (10)
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (1983) (10)
Cutting planes for multi-stage stochastic integer programs (2006) (10)
Optimal capacity expansion (1968) (10)
Optimization of automated float glass lines (2013) (10)
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (1982) (10)
Optimization of multistage separation processes by dynamic programming (1963) (10)
A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem (2018) (10)
A Polyhedral Study of Integer Variable Upper Bounds (2002) (9)
Allocating Fibers in Cable Manufacturing (1999) (9)
Letter to the Editor—A Short Table of z-Transforms and Generating Functions (1961) (9)
The 2-Edge-Connected Subgraph Polyhedron (2005) (9)
How important are branching decisions: Fooling MIP solvers (2015) (8)
Deep cuts in integer programming (1971) (8)
A dual heuristic for mixed integer programming (2015) (8)
Decomposition of loosely coupled integer programs: a multiobjective perspective (2022) (8)
The Fixed-Charge Shortest-Path Problem (2012) (7)
Estimating the size of search trees by sampling with domain knowledge (2017) (7)
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (2016) (7)
Production scheduling in almost continuous time (1997) (7)
A cutting and scheduling problem in float glass manufacturing (2014) (7)
A multi-exchange local search algorithm for the capacitated facility location problem - (Extended abstract) (2004) (7)
Temporal Expansion of a Transportation Network---II (1972) (6)
Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model (2013) (6)
Shortest Path Based Column Generation on Large Networks with Many Resource Constraints (2008) (6)
An application of vertex packing to data analysis in the evaluation of pavement deterioration (1981) (6)
Pricing for production and delivery flexibility in single-item lot-sizing (2012) (6)
A decomposable transshipment algorithm for a multiperiod transportation problem (1969) (5)
Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms (1998) (5)
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem (2012) (5)
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (2020) (5)
Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study (2011) (5)
Thinned, unequally spaced arrays designed by dynamic programming (1963) (5)
A recursive procedure for generating all mixed integer cuts (1984) (5)
Computational Complexity of Time-Dependent Shortest Path Problems (2019) (5)
A Cutting Plane Algorithm (2002) (5)
Comments on: On learning and branching: a survey (2017) (5)
Integer Programming and Combinatorial Optimization (2004) (4)
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing (2019) (4)
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (2020) (3)
The complexity of cover inequality separation 1 (1995) (2)
Matroid and Submodular Function Optimization (2014) (2)
Polynomial‐Time Algorithms for Linear Programming (2014) (2)
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming (2001) (2)
The Mathematical Programming Society (1977) (2)
Strategic Planning with Start-Time Dependent Variable Costs (2009) (2)
Some inequalities on the chromatic number of a graph (1974) (2)
Applications of Special‐Purpose Algorithms (2014) (2)
Hooked on IP (2007) (1)
On the Polyhedral Stru ture of a Multi { ItemProdu tion Planning Model with Setup (2000) (1)
Review of "State increment dynamic programming" (1970) (1)
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times (2001) (1)
A Simulated Annealing Algorithm for the Directed Steiner Tree Problem (2020) (1)
The Theory of Valid Inequalities (2014) (1)
The value function of an infinite-horizon single-item lot-sizing problem (2012) (1)
Org2006 Abstracts 1. Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decom- Position, the Fleet Assignment Problem: Solving a Large-scale Integer Program " Mathematical (2006) (1)
Maximizing a Submodular Function by Integer Programming: A Polyhedral Approach (1992) (1)
Strong Valid Inequalities and Facets for Structured Integer Programs (2014) (1)
Hooked on Optimization (2010) (0)
Analytical methodology and optimal control in urban traffic networks: volume 3 (1972) (0)
Letter to the Editor-Acknowledgment (1964) (0)
Evaluators report, the Logistics Institute/Material Handling Research Center, Georgia Institute of Technology/University of Arkansas, 1997 (1998) (0)
Erratum to: An abstract model for branching and its application to mixed integer programming (2017) (0)
Decentralized online integer programming problems with a coupling cardinality constraint (2021) (0)
State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems (2021) (0)
In memory of D. R. Fulkerson (1976) (0)
In Exaclty One Triple of T. from a Steiner Triple System We Derive a Graph the Cardinality of a Minimum Cover for a Steiner Triple System Deened On (1994) (0)
Theory and Methodology Conflict graphs in solving integer programming problems (2000) (0)
Special‐Purpose Algorithms (2014) (0)
Erratum to: An abstract model for branching and its application to mixed integer programming (2017) (0)
Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract) (1996) (0)
A cutting and scheduling problem in float glass manufacturing (2013) (0)
An exact algorithm for the service network design problem with hub capacity constraints (2022) (0)
Using Branch-and-Price to Find High Quality Solutions Quickly (2009) (0)
Book reviews (1973) (0)
Minimum concave cost flow over a grid network (2014) (0)
Solving Multi-Item Capa itated Lot-SizingProblems with Setup Times by Bran hand-CutAndrew (2000) (0)
Optimization of automated fl oat glass lines (2015) (0)
Air traffic congestion delay optimization (1996) (0)
Application of Mixed-Integer Programming to Selected Military Problems (1993) (0)
George L. Nemhauser (2020) (0)
Minimum concave cost flows in capacitated grid networks (2014) (0)
Optimizing Recruiting Asset Allocation and Routing with Integer Programming (2013) (0)
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (2017) (0)
On The Quadratic Cost partition Problem (1992) (0)
14 Airline Crew Scheduling (2002) (0)
A MINTO short course (2002) (0)
A polynomial-time algorithm for a class of minimum concave cost flow problems (2013) (0)
Comments on: On learning and branching: a survey (2017) (0)
Quantitative Assessments of the Physical and Mathematical Sciences: A Summary of the Lessons Learned: Mathematical Sciences Assessment Panel, Commission on Physical Sciences, Mathematics, and Applications, National Research Council (1994) (0)
Graphs and Networks (2014) (0)
Distributionally Robust Disaster Relief Planning under the Wasserstein Set (2022) (0)
Computational results for a stopping rule problem on averages (1968) (0)
Column generation for airline problems (1993) (0)
New Approaches for Very Large-Scale Integer Programming (2016) (0)
Search strategies in large-scale discrete optimization : a joint AI/OR approach (1997) (0)
A Combined Lagrangian, and Implication Heuristic Partitioning Problems Linear Programming, for Large-Scale Set (1995) (0)
5. Concluding Remarks 6. Acknowledgement (1991) (0)
Deployment of the MINTO mixed-integer optimization (1994) (0)
Exploiting cyberinfrastructure to solve real-time integer programs (2009) (0)
An abstract model for branching and its application to mixed integer programming (2017) (0)
Branch-and-Price Guided Search - (Extended Abstract) (2012) (0)
Graphs with K-Balanced Closed Neighborhood Matrices (1983) (0)
Research in mixed-integer programming (1992) (0)
Applications of Mixed-Integer Programming to Problems of the U.S. Army. (1996) (0)
AN ACADEMICIAN'S VIEW OF AIRLINE SCHEDULING PROBLEMS (1996) (0)
Rapid prototyping of parallel primal heuristics for domain specific MIPs : Application to maritime inventory routing (2018) (0)
Introduction to Linear Programming (1974) (0)
Combining Exact and Heuristic Approaches for Discrete Optimization (2009) (0)
Duality and Relaxation (2014) (0)
THE TRAVELING SALESMAN PROBLEM: A SURVEYt (2016) (0)
Liber amicorum for Jan Karel Lenstra (2011) (0)
A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints (1992) (0)
Nominations for the George B. Dantzig Prize (1986) (0)
Praxair production distribution model (1994) (0)

This paper list is powered by the following services:

Other Resources About George Nemhauser

en.wikipedia.org

What Schools Are Affiliated With George Nemhauser?

George Nemhauser is affiliated with the following schools:

Image Attributions

Image Source for George Nemhauser