Nemhauser G.L.

G.L. Nemhauser

Information about the author G.L. Nemhauser will soon be added to the site.
Found 15 papers in total
Lifted inequalities for 0–1 mixed integer programming: Basic theory and algorithms
Lifted inequalities for 0–1 mixed integer programming: Basic theory and algorithms
2003
We study the polyhedral structure of simple mixed integer sets that generalize the two...
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
2003
We study the mixed 0–1 knapsack polytope, which is defined by a single knapsack...
Rerouting aircraft for airline recovery
Rerouting aircraft for airline recovery
2003
Disruptions in airline transportation systems can prevent airlines from executing...
A polyhedral study of the cardinality constrained knapsack problem
A polyhedral study of the cardinality constrained knapsack problem
2003
A cardinality constrained knapsack problem is a continuous knapsack problem in which...
On the polyhedral structure of a multi-item production model with setup times
On the polyhedral structure of a multi-item production model with setup times
2003
We present and study a mixed integer programming model that arises as a substructure...
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
2003
We study a special case of a structured mixed integer programming model that arises in...
A polyhedral study of integer variable upper bounds
A polyhedral study of integer variable upper bounds
2002
We study the polyhedron of the single node capacitated network design model with...
Airline crew scheduling with regularity
Airline crew scheduling with regularity
2001
The airline crew scheduling problem is the problem of assigning crew itineraries to...
Valid inequalities for problems with additive variable upper bounds
Valid inequalities for problems with additive variable upper bounds
2001
We study the facial structure of a polyhedron associated with the single node...
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
2001
In a multiperiod dynamic network flow problem, we model uncertain arc capacities using...
Flight string models for aircraft fleeting and routing
Flight string models for aircraft fleeting and routing
1998
Given a schedule of flight legs to be flown by an airline, the fleet assignment...
The asymmetric traveling salesman problem with replenishment arcs
The asymmetric traveling salesman problem with replenishment arcs
2000
We consider a constrained asymmetric traveling salesman problem with knapsack-like...
Lifted flow cover inequalities for mixed 0–1 integer programs
Lifted flow cover inequalities for mixed 0–1 integer programs
1999
We investigate strong inequalities for mixed 0–1 integer programs derived from...
Maintenance and crew considerations in fleet assignment
Maintenance and crew considerations in fleet assignment
1996
Given a flight schedule, which is a set of flight segments with specified departure...
A strong cutting plane/branch-and-bound algorithm for node packing
A strong cutting plane/branch-and-bound algorithm for node packing
1992
The authors present a strong cutting plane/branch-and-bound algorithm for node...
Papers per page: