Pages that link to "Item:Q1881043"
From MaRDI portal
The following pages link to A study of the lot-sizing polytope (Q1881043):
Displayed 9 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)