科研之友
微信
新浪微博
Facebook
分享链接
摘要
This work gives an improved competitive analysis for an online inventory problem with bounded storage and order costs proposed by Larsen and Wohlk (2010). We improve the upper bound of the competitive ratio from (2 + 1/k) root M/m to less than 4/5(2 + 1/k)root M/m, where k, M and m are parameters of the given problem. The key idea is to use linear-fractional programming and primal-dual analysis methods to find the upper bound of a central inequality.
- 出版日期2016-3-1
- 单位电子科技大学
