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

DOI10.1007/978-3-642-02026-1_3MaRDI QIDQ3637047zbMATH OpenOpenAlexFDO

Authors Tim Nonner, Alexander Souza

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

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

Recommendations

• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
• Approximation algorithms and hardness results for the joint replenishment problem with constant demands
• Better Approximation Bounds for the Joint Replenishment Problem

Cited in

(9)

• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• The submodular joint replenishment problem
• Approximation algorithms and hardness results for the joint replenishment problem with constant demands
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
• APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
• An efficient polynomial-time approximation scheme for the joint replenishment problem
• The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
• Joint replenishment meets scheduling
• An online joint replenishment problem combined with single machine scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637047)