The following pages link to G. L. Nemhauser (Q163009):
Displaying 50 items.
- Letter to the Editor—A Short Table of <i>z</i>-Transforms and Generating Functions (Q3279738) (← links)
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- (Q3351135) (← links)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization (Q3392024) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- Sequential Pairing of Mixed Integer Inequalities (Q3596351) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- Simplex pivots on the set packing polytope (Q3701197) (← links)
- (Q3703584) (← links)
- Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” (Q3879020) (← links)
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (Q3883859) (← links)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms (Q3923934) (← links)
- Optimal set partitioning, matchings and lagrangian duality (Q3960468) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs (Q3968760) (← links)
- Some Facets for an Assignment Problem with Side Constraints (Q3976911) (← links)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533) (← links)
- (Q4035632) (← links)
- A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints (Q4035648) (← links)
- (Q4040221) (← links)
- When the Greedy Solution Solves a Class of Knapsack Problems (Q4062195) (← links)
- Set Partitioning and Chain Decomposition (Q4068444) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- (Q4101601) (← links)
- (Q4124603) (← links)
- (Q4132252) (← links)
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210) (← links)
- An analysis of approximations for maximizing submodular set functions—I (Q4152030) (← links)
- Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796) (← links)
- Tight bounds for christofides' traveling salesman heuristic (Q4180168) (← links)
- Matroids and a Reliability Analysis Problem (Q4194709) (← links)
- (Q4196269) (← links)
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (Q4199854) (← links)
- (Q4263702) (← links)
- Formulating a Mixed Integer Programming Problem to Improve Solvability (Q4285160) (← links)
- The Age of Optimization: Solving Large-Scale Real-World Problems (Q4287596) (← links)
- Recent developments and future directions in mathematical programming (Q4323679) (← links)
- Maintenance and Crew Considerations in Fleet Assignment (Q4364999) (← links)
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm (Q4367244) (← links)
- Airline Crew Scheduling with Time Windows and Plane-Count Constraints (Q4408703) (← links)
- A Stochastic Model of Airline Operations (Q4408705) (← links)
- Airline Crew Scheduling with Regularity (Q4411199) (← links)
- (Q4414645) (← links)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)
- (Q4475665) (← links)
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure (Q4530647) (← links)
- (Q4537752) (← links)
- Price-Directed Control of Remnant Inventory Systems (Q4545656) (← links)
- (Q4667441) (← links)
