Pages that link to "Item:Q828705"
From MaRDI portal
The following pages link to On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705):
Displaying 5 items.
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699) (← links)
- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation (Q6551143) (← links)