Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
From MaRDI portal
Publication:3092266
DOI10.1007/978-3-642-23719-5_53zbMath1348.90040OpenAlexW1540923370MaRDI QIDQ3092266
Claudio Telha, Andreas S. Schulz
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/76217
Inventory, storage, reservoirs (90B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Joint replenishment model with substitution ⋮ The submodular joint replenishment problem ⋮ Joint replenishment model for multiple products with substitution ⋮ The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
This page was built for publication: Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
