Approximation algorithms for capacitated stochastic inventory systems with setup costs

DOI10.1002/nav.21584zbMath1411.90039OpenAlexW2159535190MaRDI QIDQ4632839

Cong Shi, Huanan Zhang, Retsef Levi, Xiuli Chao

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/109090

zbMATH Keywords

capacityinventoryboundsapproximation algorithmssetup costrandomized cost-balancingworst-case performance guarantees

Mathematics Subject Classification ID

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

Related Items (2)

On the stochastic inventory problem under order capacity constraints ⋮ A simple heuristic policy for stochastic inventory systems with both minimum and maximum order quantity requirements

This page was built for publication: Approximation algorithms for capacitated stochastic inventory systems with setup costs