Assortment Optimization Under the Paired Combinatorial Logit Model

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

References

  • Alon N, Spencer JH (2000) The Probabilistic Methods (John Wiley & Sons, Inc., New York).CrossrefGoogle 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.LinkGoogle Scholar
  • Cardell NS (1997) Variance components structure for the extreme-value and logistic distributions with application to models of heterogeneity. Econometric Theory 13(2):185–213.CrossrefGoogle Scholar
  • Chen A, Kasikitwiwat P, Ji Z (2003) Solving the overlapping problem in route choice with paired combinatorial logit model. Transportation Res. Rec. 1857(1):65–73.CrossrefGoogle Scholar
  • Chen A, Ryu S, Xu X, Choi K (2014) Computation and application of the paired combinatorial logit stochastic user equilibrium problem. Comput. Oper. Res. 43(1):68–77.CrossrefGoogle Scholar
  • Daganzo CF, Kusnic M (1993) Two properties of the nested logit model. Transportation Sci. 27(4):395–400.LinkGoogle Scholar
  • Dai J, Ding W, Kleywegt AJ, Wang X, Zhang Y (2014) Choice based revenue management for parallel flights. Technical report, Georgia Tech, Atlanta.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.LinkGoogle Scholar
  • Desire A, Goyal V (2016) Near-optimal algorithms for capacity constrained assortment optimization. Working paper, 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.LinkGoogle Scholar
  • Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.LinkGoogle Scholar
  • Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. Working paper, 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
  • Ghuge R, Kwon J, Nagarajan V, Sharma A (2019) Constrained assortment optimization under the paired combinatorial logit model. Technical report, University of Michigan, Ann Arbor.Google Scholar
  • Goemans MX, Willamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6):1115–1145.CrossrefGoogle Scholar
  • Karoonsoontawong A, Lin D-Y (2015) Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem. Networks Spatial Econom. 15(4):1011–1048.CrossrefGoogle Scholar
  • Koppleman FS, Wen C-H (2000) The paired combinatorial logit model: Properties, estimation and application. Transportation Res. Part B: Methodological 34(2):75–89.CrossrefGoogle Scholar
  • Lau LC, Ravi R, Singh M (2011) Iterative Methods in Combinatorial Optimization (Cambridge University Press, New York).CrossrefGoogle 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.LinkGoogle Scholar
  • Li H, Webster S (2017) Optimal pricing of correlated product options under the pairwise combinatorial logit model. Oper. Res. 65(5):125–130.LinkGoogle Scholar
  • McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.CrossrefGoogle Scholar
  • Prashker J, Bekhor S (1998) Investigation of stochastic network loading procedures. Transportation Res. Rec. 1645(1):94–102.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
  • Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.LinkGoogle Scholar
  • Train K (2002) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, UK).Google Scholar
  • Vulcano G, van Ryzin G, Chaar W (2010) OM practice—Choice-based revenue management: An empirical study of estimation and optimization. Manufacturing Service Oper. Management 12(3):371–392.LinkGoogle Scholar
  • Wen C-H, Koppelman FS (2001) The generalized nested logit model. Transportation Res. Part B: Methodology 35(7):627–641.CrossrefGoogle Scholar
  • Williamson DP, Shmoys DB (2011) The Design of Approximation Algorithms (Cambridge University Press, New York).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.