Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings

Published Online:https://doi.org/10.1287/ijoc.2019.0910

References

  • Aouad A, Farias V, Levi R (2016) Assortment optimization under consider-then-choose choice models. Technical report, Massachusetts Institute of Technology, Cambridge.Google Scholar
  • Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.LinkGoogle Scholar
  • Bront JJM, Diaz IM, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.LinkGoogle Scholar
  • Davis J, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Technical report, Cornell University School of Operations Research and Information Engineering, Ithaca, NY.Google Scholar
  • Davis J, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.LinkGoogle Scholar
  • Desir A, Goyal V (2014) Near-optimal algorithms for capacity constrained assortment optimization. Technical report, Columbia University, New York.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.LinkGoogle Scholar
  • Feldman J, Liu N, Topaloglu H, Ziya S (2014) Appointment scheduling under patient preference and no-show behavior. Oper. Res. 62(4):794–811.LinkGoogle 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.CrossrefGoogle 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.LinkGoogle Scholar
  • Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Computational Optimization Research Center Technical Report TR-2004-01, Columbia University, New York.Google Scholar
  • Gallego G, Li A, Truong VA, Wang X (2016) Approximation algorithms for product framing and pricing. Technical report, Columbia University, New York.Google Scholar
  • Garey M, Johnson D (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York).Google Scholar
  • Liu N, van de Ven PM, Zhang B (2017) Managing appointment booking under customer choices. Technical report, Boston College, Boston.Google Scholar
  • Meissner J, Strauss A, Talluri K (2012) An enhanced concave program relaxation for choice network revenue management. Production Oper. Management 22(1):71–87.CrossrefGoogle 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.CrossrefGoogle Scholar
  • Mittal S, Schulz AS (2013) A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Oper. Res. 61(2):389–397.LinkGoogle Scholar
  • Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper. Res. 60(4):865–882.LinkGoogle Scholar
  • Rusmevichientong P, Shen ZJM, 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 DB, 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
  • 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
  • Vulcano G, van Ryzin GJ, Ratliff R (2012) Estimating primary demand for substitutable products from sales transaction data. Oper. Res. 60(2):313–334.LinkGoogle 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 (2013) Assortment management under the generalized attraction model with a capacity constraint. J. Revenue Pricing Management 12(3):254–270.CrossrefGoogle 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.