Better Approximation Bounds for the Joint Replenishment Problem

DOI10.1137/1.9781611973402.4zbMath1423.68589arXiv1307.2531OpenAlexW2949910472MaRDI QIDQ5383963

Marcin Bienkowski, Jaroslaw Byrka, Łukasz Jeż, Jiří Sgall, Dorian Nogneng, Marek Chrobak

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2531

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items

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 ⋮ Joint replenishment meets scheduling ⋮ An online joint replenishment problem combined with single machine scheduling ⋮ Approximation algorithms for the joint replenishment problem with deadlines ⋮ Online Algorithms for Multilevel Aggregation ⋮ Integrated Supply Chain Management via Randomized Rounding ⋮ New results on multi-level aggregation

This page was built for publication: Better Approximation Bounds for the Joint Replenishment Problem