Pages that link to "Item:Q3778511"
From MaRDI portal
The following pages link to Multiproduct dynamic lot-sizing model with coordinated replenishments (Q3778511):
Displayed 8 items.
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
- The coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q1278282) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A simple heuristic for multi-product dynamic lot sizing problems (Q1366707) (← links)
- Models and algorithms for the dynamic-demand joint replenishment problem (Q4671273) (← links)
- More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ (Q5478823) (← links)