A note: An improved upper bound for the online inventory problem with bounded storage and order costs
DOI10.1016/J.EJOR.2015.09.045zbMATH Open1347.90003OpenAlexW2165839536MaRDI QIDQ321010FDOQ321010
Authors: Wenqiang Dai, Qingzhu Jiang, Yi Feng 
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
Recommendations
- Competitive analysis of the online inventory problem
- Competitive analysis of price online inventory problem with cost function
- Competitive analysis of online inventory problem with interrelated prices
- Online lot-sizing problems with ordering, holding and shortage costs
- Online inventory replenishment scheduling of temporary orders
Online algorithms; streaming algorithms (68W27) Linear programming (90C05) Fractional programming (90C32) Inventory, storage, reservoirs (90B05)
Cites Work
Cited In (6)
- Replenishment Policy with Limited Price Information
- Optimal replenishment under price uncertainty
- Competitive difference analysis of the one-way trading problem with limited information
- Competitive analysis of the online inventory problem
- An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands
- Online economic ordering problem for deteriorating items with limited price information
This page was built for publication: A note: An improved upper bound for the online inventory problem with bounded storage and order costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321010)
