[1]KARP R M. Online algorithms versus offline algorithms: How much is it worth to know the future[M]//Proc. IFIP 12th World Computer Congress. Amsterdam, Netherlands: NorthHolland Publishing Co.,1992:416429.
[2] FLEISCHER R. On the bahncard problem [J]. Theoretical Computer Science, 2001, 268(1): 161-174.
[3]ALBINALI S. A riskreward framework for the competitive analysis of financial games [J]. Algorithmica, 1999,25(1):99-115.
[4] KARLIN A R, KENYON C, RANDALL D. Dynamic TCP acknowledgment and other stories about e/(e1)[J]. Algorithmica, 2003,36(3):209-224.
[5] 朱志军,徐寅峰,徐维军. 局内租赁问题的风险补偿模型及其竞争分析[J]. 管理科学学报,2004, 7(3):64-68.
[6] 辛春林,徐寅峰,衣方磊. 基于预期的占线特殊优惠卡问题与竞争分析[J]. 管理工程学报, 2007, 21(4):14-18.
[7] 丁黎黎,康旺霖. 占线Bahncard问题的风险补偿模型[J]. 管理科学学报, 2008, 11 (4): 38-43.
[8] 徐寅峰,徐维军,卢致杰. 存在市场利率条件下的占线租赁策略研究[J]. 系统工程, 2005, 23(3): 29-34.
[9]KARLIN A R, MANAEES M S, McGEOGH L A, et al. Competitive randomized algorithms for nonuniform problem[EB/OL]. [20150712]. https://www.researchgate.net/publication/ 220780194_Competitive_Randomized_Algorithms_for_NonUniform_Problems.
[10]IRANI S, RAMANATHAN D. The problem of renting versus buying[EB/OL]. [20150712]. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.44.8179 & %3Brep=rep1&%3Btype=pdf&origin=publication_detail.
[11] ELYANIV R, KANIEL R, LINIAL N. Competitive optimal online leasing[J]. Algorithmica, 1999,25(1):116140.
[12]FUJIWARA H, IWAMA K. Averagecase competitive analyses for skirental problems[J].Algorithmica , 2005, 42(1): 95-107.
[13]马卫民,陈国青. 价格连续型局内设备赁购问题的竞争分析[J]. 系统工程理论与实践, 2006 (4): 90-96.
[14]LOTKER Z, PATTSHAMIR B, RAWITZ D. Rent, lease or buy: randomized algorithms for multislope ski rental [EB/OL]. [2015-07-12].https://www.researchgate.net/ publication/ 220994403_Rent_Lease_or_Buy_Randomized_Algorithms_for_Multislope_Ski_Rental.
[15]张永,张卫国,徐维军. 设备购买价格可变的确定性在线租赁策略[J]. 系统工程, 2009,27(11): 52-55.
[16]刘斌,辛春林,崔文田. 具有线性交易成本的耐用性设备在线租赁策略分析[J]. 管理学报, 2011,8(10): 1549-1552.
[17]徐维军,徐寅峰,卢致杰. 具有几何分布统计特征的在线租赁竞争分析[J]. 预测, 2005,24(2): 46-51.
[18]SLEATOR D D, TARJAN R E. Amortized efficiency of list update and paging rules[J]. Communications of the ACM, 1985,28(2):202-208. |