A note: An improved upper bound for the online inventory problem with bounded storage and order costs

DOI10.1016/j.ejor.2015.09.045zbMath1347.90003OpenAlexW2165839536MaRDI QIDQ321010

Yi Feng, Wenqiang Dai, Qingzhu Jiang

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.045

zbMATH Keywords

inventorycompetitive analysisonline algorithms

Mathematics Subject Classification ID

Fractional programming (90C32) Linear programming (90C05) Inventory, storage, reservoirs (90B05) Online algorithms; streaming algorithms (68W27)

Related Items

Competitive difference analysis of the one-way trading problem with limited information, An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands, Replenishment Policy with Limited Price Information, Optimal replenishment under price uncertainty, Online economic ordering problem for deteriorating items with limited price information

Cites Work

• Competitive analysis of the online inventory problem
• Unnamed Item
• Unnamed Item
• Unnamed Item