Pages that link to "Item:Q5383963"
From MaRDI portal
The following pages link to Better Approximation Bounds for the Joint Replenishment Problem (Q5383963):
Displaying 17 items.
- 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)
- Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Online inventory replenishment scheduling of temporary orders (Q1941718) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- A new method for joint replenishment problems (Q4658416) (← 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)
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms (Q5166263) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- An online joint replenishment problem combined with single machine scheduling (Q6166202) (← links)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost (Q6554602) (← links)
