The following pages link to G. L. Nemhauser (Q163009):
Displaying 37 items.
- (Q4694400) (← links)
- (Q4737525) (← links)
- (Q4737534) (← links)
- Properties of vertex packing and independence system polyhedra (Q4766816) (← links)
- (Q4943600) (← links)
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems (Q5084656) (← links)
- Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting (Q5085472) (← links)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems (Q5086009) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- Cutting Planes for Multistage Stochastic Integer Programs (Q5189000) (← links)
- Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model (Q5265180) (← links)
- On the Relation Between the Traveling-Salesman and the Longest-Path Problems (Q5328561) (← links)
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem (Q5328566) (← links)
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints (Q5429283) (← links)
- Decomposition of linear programs by dynamic programming (Q5510362) (← links)
- An Algorithm for the Line Balancing Problem (Q5511896) (← links)
- Scheduling to Minimize Interaction Cost (Q5514166) (← links)
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem (Q5550290) (← links)
- Optimal capacity expansion (Q5567592) (← links)
- The Set-Partitioning Problem: Set Covering with Equality Constraints (Q5576127) (← links)
- A decomposable transshipment algorithm for a multiperiod transportation problem (Q5589733) (← links)
- Optimal Political Districting by Implicit Enumeration Techniques (Q5591291) (← links)
- The Traveling Salesman Problem: A Survey (Q5615771) (← links)
- A finiteness proof for modified dantzig cuts in integer programming (Q5619007) (← links)
- A Modified Linear Program for Columnar Methods in Mathematical Programming (Q5629425) (← links)
- (Q5675139) (← links)
- Facets of the Complementarity Knapsack Polytope (Q5704071) (← links)
- A Polyhedral Study of Integer Variable Upper Bounds (Q5704105) (← links)
- The mixed vertex packing problem. (Q5926330) (← links)
- A generalized assignment problem with special ordered sets: a polyhedral approach. (Q5926336) (← links)
- Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results (Q5942940) (← links)
- Solving large airline crew scheduling problems: Random pairing generation and strong branching (Q5946770) (← links)
- A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
- Valid inequalities for problems with additive variable upper bounds (Q5955566) (← links)
- Comments on: ``On learning and branching: a survey'' (Q5971157) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
