Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem

DOI10.4230/LIPIcs.APPROX-RANDOM.2014.209zbMath1360.90011OpenAlexW2131232867MaRDI QIDQ2969619

Takuro Fukunaga, Afshin Nikzad, R. Ravi

Publication date: 22 March 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.209

zbMATH Keywords

approximation algorithmprize-collecting Steiner treeinventry routing problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Related Items (4)

Improved Approximation Algorithms for Inventory Problems ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ Combinatorial Heuristics for Inventory Routing Problems ⋮ Improved approximation for the capacitated inventory access point problem

This page was built for publication: Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem