Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models

References

• Aouad A, Farias V, Levi R (2016) Assortment optimization under consider-then-choose choice models. Report, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Aouad A, Levi R, Segev D (2018b) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper. Res. 66(5):1321–1345.Link, Google Scholar
• Aouad A, Farias V, Levi R, Segev D (2018a) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
• Aouad A, Feldman J, Segev D, Zhang DJ (2019) Click-based MNL: Algorithmic frameworks for modeling click data in assortment optimization. Report, Washington University, St. Louis, MO.Google Scholar
• Aouad A, Segev D (2019) The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications. Report, University of Haifa, Haifa, Israel.Google Scholar
• Bai Y, Feldman J, Topaloglu H, Wagner L (2021) Assortment optimization under the multinomial logit model in the presence of endogenous consideration sets. Report, Cornell University, Ithaca, NY.Google Scholar
• Berbeglia G, Garassino A, Vulcano G (2022) A comparative empirical study of discrete choice models in retail operations. Management Sci. 68(6):4005–4023.Link, Google Scholar
• Bishop CM (2006) Pattern Recognition and Machine Learning (Springer, New York).Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Bront JJM, Mendez-Diaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
• Dai J, Ding W, Kleywegt AJ, Wang X, Zhang Y (2014) Choice based revenue management for parallel flights. Report, Georgia Tech, Atlanta.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
• Desir A, Goyal V, Zhang J (2016) Near-optimal algorithms for capacity constrained assortment optimization. Report, Columbia University, New York.Google Scholar
• Farias VF, Jagabathula S, Shah D (2013) A non-parametric approach to modeling choice with limited data. Management Sci. 59(2):305–322.Link, Google Scholar
• Feldman J, Segev D (2019) Improved approximation schemes for MNL-driven sequential assortment optimization. Report, Washington University, St. Louis, MO.Google Scholar
• Feldman JB, Topaloglu H (2015) Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Feldman J, Topaloglu H (2017) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Feldman J, Topaloglu H (2018) Technical note: Capacitated assortment optimization under the multinomial logit model with nested consideration sets. Oper. Res. 66(2):380–391.Link, Google Scholar
• Feldman J, Paul A, Topaloglu H (2019) Assortment optimization with small consideration sets. Oper. Res. 67(5):1283–1299.Link, Google Scholar
• Flores A, Berbeglia G, van Hentenryck P (2019) Assortment optimization under the sequential multinomial logit model. Eur. J. Oper. Res. 273(3):1052–1064.Crossref, 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, 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, Computational Optimization Research Center, Columbia University, New York.Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York).Google Scholar
• Jagabathula S (2016) Assortment optimization under general choice. Report, New York University, New York.Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Kamishima T (2018) Sushi preference datasets. Accessed January 8, 2021, https://www.kamishima.net/sushi/.Google Scholar
• Kunnumkal S, Martinez-de-Albeniz V (2019) Tractable approximations for assortment planning with product costs. Oper. Res. 67(2):436–452.Abstract, Google Scholar
• Kunnumkal S, Topaloglu H (2010) A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management 19(5):575–590.Crossref, 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
• Liu N, Ma Y, Topaloglu H (2022) Assortment optimization under the multinomial logit model with sequential offerings. INFORMS J. Comput. Forthcoming.Google Scholar
• Ma W (2019) Assortment auctions: A Myersonian characterization for Markov chain based choice models. Report, Columbia University, New York.Google Scholar
• McFadden D (1980) Econometric models for probabilistic choice among products. J. Bus. 53(3):S13–S29.Crossref, Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15:447–470.Crossref, Google Scholar
• Mendez-Diaz I, Bront JJM, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164(1):246–263.Crossref, Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Prod. Oper. Manag. 23(11):2023–2039.Crossref, Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis JM (2019) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Report, Cornell University, Ithaca, NY.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
• 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 GJ (2005) Future of revenue management: Models of demand. J. Revenue Pricing Management 4:204–210.Crossref, 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
• Vulcano G, van Ryzin G, Chaar W (2010) Choice-based revenue management: An empirical study of estimation and optimization. Manufacturing Service Oper. Management 12(3):371–392.Link, Google Scholar
• Wang R (2012) Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40(6):492–497.Crossref, Google Scholar
• Wang R, Sahin O (2018) The impact of consumer search cost on assortment planning and pricing. Management Sci. 64(8):3649–3666.Link, 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 (2020) Assortment optimization under the paired combinatorial logit model. Oper. Res. 68(3):741–761.Link, Google Scholar