Nemhauser George L.

George L. Nemhauser

Information about the author George L. Nemhauser will soon be added to the site.
Found 51 papers in total
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
2000
We consider a dynamic network flow problem where the arc capacities are random...
Price-directed control of remnant inventory systems
Price-directed control of remnant inventory systems
1999
Motivated by make-to-order cable manufacturing, we describe a remnant inventory system...
The complexity of cover inequality separation
The complexity of cover inequality separation
1998
Crowder et al . conjectured that the separation problem for cover inequalities for...
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
2000
We consider the single item capacitated lot-sizing problem, a well-known production...
Conflict graphs in solving integer programming problems
Conflict graphs in solving integer programming problems
2000
We report on the use of conflict graphs in solving integer programs. A conflict graph...
Airline crew scheduling: A new formulation and decomposition algorithm
Airline crew scheduling: A new formulation and decomposition algorithm
1997
Airline crew scheduling is concerned with finding a minimum cost assignment of flight...
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
1995
Given a finite ground set, a set of subsets, and costs on the subsets, the set...
Allocating fibers in cable manufacturing
Allocating fibers in cable manufacturing
1999
We study the problem of allocating stocked fibers to made-to-order cables with the...
Lifted cover inequalities for 0–1 integer programs: Complexity
Lifted cover inequalities for 0–1 integer programs: Complexity
1999
We investigate several complexity issues related to branch-and-cut algorithms for...
An optimization based heuristic for political districting
An optimization based heuristic for political districting
1998
Redistricting, the redrawing of congressional district boundaries within the states,...
Lifted cover inequalities for 0–1 integer programs: Computation
Lifted cover inequalities for 0–1 integer programs: Computation
1998
We investigate the algorithmic and implementation issues related to the effective and...
Scheduling a major college basketball conference
Scheduling a major college basketball conference
1998
The nine universities in the Atlantic Coast Conference (ACC) have a basketball...
Branch-and-price: Column generation for solving huge integer programs
Branch-and-price: Column generation for solving huge integer programs
1998
We discuss formulations of integer programs with a huge number of variables and their...
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
1996
We give a new mixed integer programming (MIP) formulation for the quadratic cost...
Production scheduling in almost continuous time
Production scheduling in almost continuous time
1997
We present a large-scale production scheduling problem where each order is unique and...
The fleet assignment problem: Solving a large-scale integer program
The fleet assignment problem: Solving a large-scale integer program
1995
Given a flight schedule and set of aircraft, the fleet assignment problem is to...
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
1994
Facet-defining inequalities lifted from minimal covers are used as strong cutting...
Min-cut clustering
Min-cut clustering
1993
The authors describe a decomposition framework and a column generation scheme for...
Some properties of the fleet assignment problem
Some properties of the fleet assignment problem
1994
Given a flight schedule and fleets of different types of planes, the fleet assignment...
MINTO, a Mixed INTeger Optimizer
MINTO, a Mixed INTeger Optimizer
1994
MINTO is a software system that solves mixed-integer linear programs by a...
Formulating a mixed integer programming problem to improve solvability
Formulating a mixed integer programming problem to improve solvability
1993
A standard formulation of a real-world distribution problem could not be solved, even...
Experiments with parallel branch-and-bound algorithms for the set covering problem
Experiments with parallel branch-and-bound algorithms for the set covering problem
1993
The authors discuss the results of computational experiments using a new parallel...
The age of optimization: Solving large-scale real-world problems
The age of optimization: Solving large-scale real-world problems
1994
In the last decade, new advances in algorithms have been as important as the...
Recent developments and future directions in mathematical programming
Recent developments and future directions in mathematical programming
1992
Recent advances in mathematical programming methodology have included: development of...
Papers per page: