Stochastic Knapsack Revisited: The Service Level Perspective

References

• Abernethy J, Bartlett PL, Hazan E (2011) Blackwell approachability and no-regret learning are equivalent. Kakade SM, von Luxburg U, eds. Proc. 24th Annual Conf. Learning Theory (Proceedings of Machine Learning Research, Budapest), 27–46.Google Scholar
• Alptekinoǧlu A, Banerjee A, Paul A, Jain N (2013) Inventory pooling to deliver differentiated service. Manufacturing Service Oper. Management 15(1):33–44.Link, Google Scholar
• Axsäter S (2003) Note: Optimal policies for serial inventory systems under fill rate constraints. Management Sci. 49(2):247–253.Link, Google Scholar
• Bertsimas D, Natarajan K, Teo CP (2006) Persistence in discrete optimization under data uncertainty. Math. Programming 108(2-3):251–274.Crossref, Google Scholar
• Bimpikis K, Markakis MG (2015) Inventory pooling under heavy-tailed demand. Management Sci. 62(6):1800–1813.Link, Google Scholar
• Blackwell D (1956) An analog of the minimax theorem for vector payoffs. Pacific J. Math. 6(1):1–8.Crossref, Google Scholar
• Blado D, Hu W, Toriello A (2016) Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes. SIAM J. Optim. 26(3):1625–1648.Crossref, Google Scholar
• Boyaci T, Gallego G (2001) Serial production/distribution systems under service constraints. Manufacturing Service Oper. Management 3(1):43–50.Link, Google Scholar
• Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Corbett CJ, Rajaram K (2006) A generalization of the inventory pooling effect to nonnormal dependent demand. Manufacturing Service Oper. Management 8(4):351–358.Link, Google Scholar
• Dean BC, Goemans MX, Vondrák J (2008) Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. 33(4):945–964.Link, Google Scholar
• Derman C, Lieberman GJ, Ross SM (1978) A renewal decision problem. Management Sci. 24(5):554–561.Link, Google Scholar
• Eppen GD (1979) Note: Effects of centralization on expected costs in a multi-location newsboy problem. Management Sci. 25(5):498–501.Link, Google Scholar
• Gentle JE (2009) Computational Statistics, vol. 308 (Springer, New York).Crossref, Google Scholar
• Gupta A, Krishnaswamy R, Molinaro M, Ravi R (2011) Approximation algorithms for correlated knapsacks and non-martingale bandits. Proc. IEEE 52nd Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society, Palm Springs, CA), 827–836.Google Scholar
• Henig MI (1990) Risk criteria in a stochastic knapsack problem. Oper. Res. 38(5):820–825.Link, Google Scholar
• Hou IH, Borkar V, Kumar PR (2009) A theory of QoS for wireless. Proc. IEEE INFOCOM 2009 (IEEE Communications Society, Rio de Janeiro, Brazil), 486–494.Google Scholar
• İlhan AT, Iravani SM, Daskin MS (2011) The adaptive knapsack problem with stochastic rewards. Oper. Res. 59(1):242–248.Link, Google Scholar
• Jiang J, Wang S, Zhang J (2019) Achieving high individual service-levels without safety stock? Optimal rationing policy of pooled resources. Preprint, submitted August 22, https://dx.doi.org/10.2139/ssrn.3385089.Google Scholar
• Kleywegt AJ, Papastavrou JD (1998) The dynamic and stochastic knapsack problem. Oper. Res. 46(1):17–35.Link, Google Scholar
• Lawler EL (1979) Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4):339–356.Link, Google Scholar
• Lee HL (2004) The triple-A supply chain. Harvard Bus. Rev. 82(10):102–113.Google Scholar
• Li X, Rong Y, Zhang RP, Zheng H (2021) Online advertisement allocation in the presence of customer choices. Preprint, submitted February 17, http://dx.doi.org/10.2139/ssrn.3538755.Google Scholar
• Lyu G, Cheung WC, Teo CP, Wang H (2020) Multi-objective online ride-matching. Preprint, submitted April 17, https://dx.doi.org/10.2139/ssrn.3356823.Google Scholar
• Lyu G, Cheung WC, Chou MC, Teo CP, Zheng Z, Zhong Y (2019) Capacity allocation in flexible production networks: Theory and applications. Management Sci. 65(11):5091–5109.Link, Google Scholar
• Natarajan K, Song M, Teo CP (2009) Persistency model and its applications in choice modeling. Management Sci. 55(3):453–469.Link, Google Scholar
• Natarajan K, Teo CP, Zheng Z (2011) Mixed 0-1 linear programs under objective uncertainty: A completely positive representation. Oper. Res. 59(3):713–728.Link, Google Scholar
• Swaminathan JM, Srinivasan R (1999) Managing individual customers service constrains under stochastic demand. Oper. Res. Lett. 24(3):115–125.Crossref, Google Scholar
• Zhong Y, Zheng Z, Chou MC, Teo CP (2018) Resource pooling and allocation policies to deliver differentiated service. Management Sci. 64(4):1555–1573.Link, Google Scholar