The following pages link to Laurence A. Wolsey (Q173889):
Displaying 50 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
- Strong and compact relaxations in the original space using a compact extended formulation (Q458127) (← links)
- (Q494316) (redirect page) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (Q507343) (← links)
- (Q691391) (redirect page) (← links)
- On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- On the balanced minimum evolution polytope (Q783026) (← links)
- (Q826075) (redirect page) (← links)
- Decomposition of integer programs and of generating sets (Q826076) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- Uncapacitated two-level lot-sizing (Q991455) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Optimizing production and transportation in a commit-to-delivery business mode (Q1046062) (← links)
- Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- The b-hull of an integer program (Q1151337) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs (Q1237653) (← links)
- Cubical Sperner lemmas as applications of generalized complementary pivoting (Q1242861) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- The 0-1 knapsack problem with a single continuous variable (Q1295954) (← links)
- Optimal placement of add/drop multiplexers: Static and dynamic models (Q1295992) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Modelling piecewise linear concave costs in a tree partitioning problem (Q1326744) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
- Strong formulations for mixed integer programs: valid inequalities and extended formulations (Q1403296) (← links)
- The Aussois 2000 workshop in combinatorial optimization. Introduction (Q1411608) (← links)
- Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
- Tight formulations for some simple mixed integer programs and convex objective integer programs (Q1424279) (← links)
- On the cut polyhedron. (Q1426123) (← links)
