Pages that link to "Item:Q3637368"
From MaRDI portal
The following pages link to Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems (Q3637368):
Displaying 14 items.
- Compact formulations as a union of polyhedra (Q927156) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
- Manufacturer's mixed pallet design problem (Q2462174) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems (Q5451188) (← links)
