An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
From MaRDI portal
Publication:4910826
DOI10.1007/978-3-642-36694-9_27zbMath1377.90007OpenAlexW2163009500MaRDI QIDQ4910826
Publication date: 19 March 2013
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_27
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Approximation algorithms (68W25)
Related Items (4)
Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ The submodular joint replenishment problem ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
This page was built for publication: An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem