Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments

Published Online:https://doi.org/10.1287/opre.2022.2384

References

  • Aouad A, Levi R, Segev D (2018) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper. Res. 66(5):1321–1345.LinkGoogle Scholar
  • Aouad A, Feldman J, Segev D, Zhang DJ (2019) Click-based MNL Model: Algorithmic frameworks for modeling click data in assortment optimization. Preprint, submitted March 17, https://dx.doi.org/10.2139/ssrn.3340620.Google Scholar
  • Aouad A, Elmachtoub AN, Ferreira KJ, McNellis R (2020) Market segmentation trees. Preprint, submitted January 15, https://arxiv.org/abs/1906.01174v2.Google Scholar
  • Berbeglia G, Joret G (2020) Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments. Algorithmica 82(4):681–720.CrossrefGoogle Scholar
  • Berbeglia G, Flores A, Gallego G (2021) The refined assortment optimization problem. Preprint, submitted February 5, https://arxiv.org/abs/2102.03043.Google Scholar
  • Bront JJM, Méndez-Díaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.LinkGoogle Scholar
  • Désir A, Goyal V, Zhang J (2022) Capacitated assortment optimization: Hardness and approximation. Oper. Res. (INFORMS) 70(2):893–904.Google Scholar
  • Feldman J, Topaloglu H (2015) Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Production Oper. Management 24(10):1598–1620.CrossrefGoogle 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.LinkGoogle Scholar
  • Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Computational Optimization Research Center Technical Report No. TR-2004-01, Columbia University, New York.Google Scholar
  • Gao P, Ma Y, Chen N, Gallego G, Li A, Rusmevichientong P, Topaloglu H (2021) Assortment optimization and pricing under the multinomial logit model with impatient customers: Sequential recommendation and selection. Oper. Res. 69(5):1509–1532.LinkGoogle Scholar
  • Jagabathula S (2016) Assortment optimization under general choice. Preprint, submitted March 5, https://dx.doi.org/10.2139/ssrn.2512831.Google Scholar
  • Jagabathula S, Vulcano G (2018) A partial-order-based model to estimate individual preferences using panel data. Management Sci. 64(4):1609–1628.LinkGoogle Scholar
  • Jagabathula S, Mitrofanov D, Vulcano G (2022) Personalized retail promotions through a directed acyclic graph–based representation of customer preferences. Oper. Res. 70(2):641–665.LinkGoogle Scholar
  • Kaggle (2013) Personalize Expedia hotel searches. Accessed August 5, 2019, https://www.kaggle.com/c/expedia-personalized-sort.Google Scholar
  • Ma W (2022) When is assortment optimization optimal? Management Sci., ePub ahead of print June 22, https://doi.org/10.1287/mnsc.2022.4471.LinkGoogle Scholar
  • Méndez-Díaz I, Bront JJM, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164:246–263.CrossrefGoogle Scholar
  • Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math. Programming 14(1):265–294.CrossrefGoogle 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.LinkGoogle 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.CrossrefGoogle Scholar
  • Sen A, Atamturk A, Kaminsky P (2018) Technical note–A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4):994–1003.LinkGoogle Scholar
  • Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis JM(2020) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.LinkGoogle Scholar
  • Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.LinkGoogle Scholar
  • Udwani R (2021) Submodular order functions and assortment optimization. Preprint, submitted July 6, https://arxiv.org/abs/2107.02743.Google Scholar
  • Wang R (2012) Capacitated assortment and price optimization under the multinomial logit model. Oper. Res. Lett. 40(6):492–497.CrossrefGoogle Scholar
  • Wang R, Sahin O (2018) The impact of consumer search cost on assortment planning and pricing. Management Sci. 64(8):3649–3666.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.