Dynamic Assortment Optimization for Reusable Products with Random Usage Durations

References

• Adelman D (2007) Dynamic bid prices in revenue management. Oper. Res. 55(4):647–661.Link, Google Scholar
• Aouad A, Levi R, Segev D (2019) Approximation algorithms for dynamic assortment optimization models. Math. Oper. Res. 44(2):487–511.Google Scholar
• Aouad A, Levi R, Segev D (2018) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper. Res. 66(5):1321–1345.Abstract, Google Scholar
• Bertsekas DP, Tsitsiklis JN (1996) Neuro-Dynamic Programming (Athena Scientific, Belmont, MA).Google Scholar
• Chen Y, Levi R, Shi C (2017) Revenue management of reusable resources with advanced reservations. Production Oper. Management. 26(5):836–859.Crossref, Google Scholar
• City of Seattle (2017) Seattle parking transactions. Accessed August 1, 2017, https://data.seattle.gov/Transportation/Seattle-Parking-Transactions/updn-y53g.Google Scholar
• Dai J, Ding W, Kleywegt AJ, Wang X, Zhang Y (2014) Choice based revenue management for parallel flights. Technical report, Georgia Tech, Atlanta, GA.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Technical report, Cornell University, Ithaca, NY.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Desire A, Goyal V, Zhang J (2016) Near-optimal algorithms for capacity constrained assortment optimization. Technical report, Columbia University, New York.Google Scholar
• Feldman JB, Topaloglu H (2015) Technical note: Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Gallego G, Ratliff R, Shebalov S (2015) A general attraction model and sales-based linear programming formulation for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. CORC Technical Report TR-2004-01, Columbia University, New York.Google Scholar
• Gallego G, Li A, Truong VA, Wang X (2016) Online bipartite matching. Working paper, Columbia University, New York.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Goyal V, Levi R, Segev D (2016) Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand. Oper. Res. 64(1):219–235.Link, Google Scholar
• Honhon D, Gaur V, Seshadri S (2010) Assortment planning and inventory decisions under stockout-based substitution. Oper. Res. 58(5):1364–1379.Link, Google Scholar
• Lei Y, Jasin S (2016) Real-time dynamic pricing for revenue management with reusable resources and deterministic service time requirements. Technical report, University of Michigan, Ann Arbor.Google Scholar
• Levi R, Radovanovic A (2010) Provably near-optimal LP-based policies for revenue management in systems with reusable resources. Oper. Res. 58(2):503–507.Link, Google Scholar
• Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: Assortment and price optimization problems. Oper. Res. 63(2):325–342.Link, Google Scholar
• Liu Q, van Ryzin GJ (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management. 10(2):288–310.Link, Google Scholar
• Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic customer substitution. Oper. Res. 49(3):334–351.Link, Google Scholar
• Owen Z, Simchi-Levi D (2017) Price and assortment optimization for reusable resources. Technical report, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Ozer O, Phillips R, eds. (2012) The Oxford Handbook of Pricing Management (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management. 23(11):2023–2039.Crossref, Google Scholar
• Stein C, Truong VA, Wang X (2019) Advance reservations with heterogeneous customers. Management Sci., ePub ahead of print October 15, https://doi.org/10.1287/mnsc.2019.3364.Google Scholar
• Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Talluri KT, van Ryzin GJ (2005) The Theory and Practice of Revenue Management (Kluwer Academic Publishers, Boston).Crossref, Google Scholar
• Tong C, Topaloglu H (2013) On the approximate linear programming approach for network revenue management problems. INFORMS J. Comput. 26(1):121–134.Link, Google Scholar
• Topaloglu H (2013) Joint stocking and product offer decisions under the multinomial logit model. Production Oper. Management. 22(5):1182–1199.Crossref, Google Scholar
• van Ryzin G, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.Link, Google Scholar
• Vossen TWM, Zhang D (2015) Reductions of approximate linear programs for network revenue management. Oper. Res. 63(6):1352–1371.Link, Google Scholar
• Wang X, Truong VA, Bank D (2016) Online advance admission scheduling for services, with customer preferences. Working paper, Columbia University, New York.Google Scholar
• Zhang D, Adelman D (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Sci. 43(3):381–394.Link, Google Scholar
• Zhang D, Cooper WL (2005) Revenue management for parallel flights with customer choice behavior. Oper. Res. 53(3):415–431.Link, Google Scholar
• Zhang H, Rusmevichientong P, Topaloglu H (2017) Assortment optimization under the paired combinatorial logit model. Technical report, Cornell University, Ithaca, NY.Google Scholar