Approximation algorithms for the joint replenishment problem with deadlines

DOI10.1007/978-3-642-39206-1_12MaRDI QIDQ6827235zbMATH OpenFDO

Authors Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Świrszcz, Neal E. Young

Publication date 6 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://escholarship.org/uc/item/1mx0h30j

zbMATH Keywords

linear programmingapproximation algorithmintegrality gaprandomized roundinginventory theoryjoint replenishment problem with deadlines

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Approximation algorithms for the joint replenishment problem with deadlines

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