A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines

DOI10.1007/978-3-642-02026-1_3zbMath1246.90011OpenAlexW1485446666MaRDI QIDQ3637047

Alexander Souza, Tim Nonner

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_3

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

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 ⋮ Joint replenishment meets scheduling ⋮ An online joint replenishment problem combined with single machine scheduling ⋮ The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard

This page was built for publication: A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines