The following pages link to Four equivalent lot-sizing models (Q1003497):
Displayed 15 items.
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (Q507343) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
- A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales (Q2997889) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)