The following pages link to Laurence A. Wolsey (Q173889):
Displaying 50 items.
- On unions and dominants of polytopes (Q1434071) (← links)
- Convex hull results for the warehouse problem (Q1756347) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
- A new approach to minimising the frontwidth in finite element calculations (Q1912069) (← links)
- Optimizing constrained subtrees of trees (Q1914069) (← links)
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983) (← links)
- The item dependent stockingcost constraint (Q2009188) (← links)
- The weighted arborescence constraint (Q2011589) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks'' (Q2314415) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- Extended formulations for Gomory corner polyhedra (Q2386199) (← links)
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- Combinatorial optimization: Theory and computation. The Aussois Workshop 2004. Introduction (Q2583119) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Traces of the XII Aussois Workshop on combinatorial optimization (Q2638379) (← links)
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772) (← links)
- On the Wagner-Whitin lot-sizing polyhedron. (Q2757684) (← links)
- Optimal placement of add/drop multiplexers: Heuristic and exact algorithms (Q2781111) (← links)
- A maritime inventory routing problem: discrete time formulations and valid inequalities (Q2811316) (← links)
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates (Q2892288) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Lot-Sizing with Stock Upper Bounds and Fixed Charges (Q3008012) (← links)
- Constrained Infinite Group Relaxations of MIPs (Q3083313) (← links)
- Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges (Q3094941) (← links)
- (Q3109953) (← links)
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs (Q3114714) (← links)
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820) (← links)
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems (Q3116760) (← links)
- Network Formulations of Mixed-Integer Programs (Q3169026) (← links)
- Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs (Q3169109) (← links)
- (Q3204309) (← links)
- Mixing Sets Linked by Bidirected Paths (Q3225243) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- Uncapacitated lot-sizing: The convex hull of solutions (Q3343777) (← links)
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes (Q3351124) (← links)
- (Q3351135) (← links)
- Uncapacitated Lot-Sizing Problems with Start-Up Costs (Q3474475) (← links)
- The Mixing Set with Flows (Q3503224) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
