Primal-Dual Algorithms for Deterministic Inventory Problems
From MaRDI portal
(Redirected from Publication:5387979)
Recommendations
- Online make-to-order joint replenishment model: primal-dual competitive algorithms
- Improved approximation algorithms for inventory problems
- Approximation algorithms for inventory problems with submodular or routing costs
- Approximation Algorithms for Stochastic Inventory Control Models
- Approximation Algorithms for Stochastic Inventory Control Models
Cited in
(27)- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
- Multi-item lot-sizing with joint set-up costs
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
- Single-item dynamic lot-sizing problems: an updated survey
- New results on multi-level aggregation
- Online lot-sizing problems with ordering, holding and shortage costs
- A polynomial time algorithm for a deterministic joint pricing and inventory model
- On reformulations for the one-warehouse multi-retailer problem
- The submodular joint replenishment problem
- Integrating facility location and production planning decisions
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
- Approximation algorithms for inventory problems with submodular or routing costs
- Primal-Dual Schema for Capacitated Covering Problems
- Improved approximation algorithms for inventory problems
- Combinatorial heuristics for inventory routing problems
- Online Algorithms for Multilevel Aggregation
- Integrated Supply Chain Management via Randomized Rounding
- Online make-to-order joint replenishment model: primal-dual competitive algorithms
- The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
- Duality and Existence of Optimal Policies in Generalized Joint Replenishment
- Supply chain management with online customer selection
- Joint replenishment meets scheduling
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
- On the power of lookahead in online lot-sizing
- An online joint replenishment problem combined with single machine scheduling
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Primal-dual schema for capacitated covering problems
This page was built for publication: Primal-Dual Algorithms for Deterministic Inventory Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387979)
