Primal-Dual Algorithms for Deterministic Inventory Problems
From MaRDI portal
Publication:5387979
DOI10.1287/moor.1050.0178zbMath1278.90026OpenAlexW2114086213MaRDI QIDQ5387979
Robin Roundy, Retsef Levi, David B. Shmoys
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1050.0178
Related Items
On reformulations for the one-warehouse multi-retailer problem, Improved Approximation Algorithms for Inventory Problems, Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem, The submodular joint replenishment problem, 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, Combinatorial Heuristics for Inventory Routing Problems, 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, Primal-Dual Schema for Capacitated Covering Problems, Joint replenishment meets scheduling, Single-item dynamic lot-sizing problems: an updated survey, An online joint replenishment problem combined with single machine scheduling, Approximation algorithms for the joint replenishment problem with deadlines, Approximation algorithms for supply chain planning and logistics problems with market choice, Online Algorithms for Multilevel Aggregation, Integrated Supply Chain Management via Randomized Rounding, New results on multi-level aggregation, Supply Chain Management with Online Customer Selection, Integrating facility location and production planning decisions, Multi-item lot-sizing with joint set-up costs, Primal-dual schema for capacitated covering problems, The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
