An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem

DOI10.1287/moor.2013.0611zbMath1291.90023OpenAlexW2155444594MaRDI QIDQ5169708

Danny Segev

Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2013.0611

zbMATH Keywords

dynamic programmingapproximation algorithmsjoint replenishment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (2)

The submodular joint replenishment problem ⋮ The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard

This page was built for publication: An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem