Pages that link to "Item:Q5387979"
From MaRDI portal
The following pages link to Primal-Dual Algorithms for Deterministic Inventory Problems (Q5387979):
Displayed 23 items.
- On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
- The submodular joint replenishment problem (Q304238) (← links)
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- On the power of lookahead in online lot-sizing (Q614030) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- Integrating facility location and production planning decisions (Q3057133) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- An online joint replenishment problem combined with single machine scheduling (Q6166202) (← links)
