The following pages link to Laurence A. Wolsey (Q173889):
Displaying 50 items.
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (Q3503866) (← links)
- Reformulation and Decomposition of Integer Programs (Q3565242) (← links)
- Experiments with Two Row Tableau Cuts (Q3569836) (← links)
- Aggregation and Mixed Integer Rounding to Solve MIPs (Q3635007) (← links)
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems (Q3637368) (← links)
- Trees and Cuts (Q3674420) (← links)
- Valid Linear Inequalities for Fixed Charge Problems (Q3703656) (← links)
- Sensitivity Analysis for Branch and Bound Integer Programming (Q3706845) (← links)
- Strong Formulations for Multi-Item Capacitated Lot Sizing (Q3737151) (← links)
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (Q3883859) (← links)
- Heuristic analysis, linear programming and branch and bound (Q3885519) (← links)
- A resource decomposition algorithm for general mathematical programs (Q3896856) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- An elementary survey of general duality theory in mathematical programming (Q3921006) (← links)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms (Q3923934) (← links)
- On the use of penumbras in blocking and antiblocking theory (Q3931051) (← links)
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems (Q3964292) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- Valid Inequalities for the Lasdon-Terjung Production Model (Q4018532) (← links)
- (Q4040221) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)
- (Q4054818) (← links)
- Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
- (Q4083208) (← links)
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs (Q4108138) (← links)
- Further facet generating procedures for vertex packing polytopes (Q4119038) (← links)
- (Q4145427) (← 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)
- Valid Inequalities and Superadditivity for 0–1 Integer Programs (Q4187583) (← links)
- (Q4196269) (← links)
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (Q4199854) (← links)
- (Q4254875) (← links)
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities (Q4286933) (← links)
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs (Q4287947) (← links)
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances (Q4642458) (← links)
- Uncapacitated lot-sizing with buying, sales and backlogging (Q4657824) (← links)
- Solving Mixed Integer Programming Problems Using Automatic Reformulation (Q4723573) (← links)
- On the Greedy Heuristic for Continuous Covering and Packing Problems (Q4750653) (← links)
- (Q4840775) (← links)
- (Q4845371) (← links)
- Capacitated Facility Location: Valid Inequalities and Facets (Q4864872) (← links)
- (Q4880888) (← links)
- (Q4943600) (← links)
- Integer Programming (Q5130591) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Inequalities from Two Rows of a Simplex Tableau (Q5429253) (← links)
- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows (Q5429279) (← links)
- (Q5465106) (← links)
- Production Planning by Mixed Integer Programming (Q5472085) (← links)
