Constrained Assortment Optimization Under the Paired Combinatorial Logit Model

References

• Ageev AA, Hassin R, Sviridenko M (2001) A 0.5-approximation algorithm for MAX DICUT with given sizes of parts. SIAM J. Discrete Math. 14(2):246–255.Crossref, Google Scholar
• Ageev AA, Sviridenko M (1999) Approximation algorithms for maximum coverage and max cut with given sizes of parts. Cornuejols G, Burkard RE, Woeginger GJ, eds. Integer Programming Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1610 (Springer), 17–30.Crossref, Google Scholar
• Arora S, Karger DR, Karpinski M (1999) Polynomial time approximation schemes for dense instances of np-hard problems. J. Comput. System Sci. 58(1):193–210.Crossref, Google Scholar
• Bekhor S, Prashker J (1998) Investigation of stochastic network loading procedures. Transportation Res. Record 1645(1):94–102.Crossref, 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
• Buchbinder N, Feldman M (2019) Constrained submodular maximization via a nonsymmetric technique. Math. Oper. Res. 44(3):988–1005.Link, Google 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.Crossref, Google Scholar
• Davis J, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper, Cornell University, 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.Link, Google Scholar
• Feldman J (2017) Technical note: Space constrained assortment optimization under the paired combinatorial logit model. Preprint, submitted August 5, https://dx.doi.org/10.2139/ssrn.3013321.Google Scholar
• Feldman J, Topaloglu H (2015) 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
• Goemans M, Williamson D (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6):1115–1145.Crossref, Google Scholar
• Håstad J (2001) Some optimal inapproximability results. J. ACM 48(4):798–859.Crossref, Google Scholar
• Karoonsoontawong A, Lin DY (2015) Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem. Networks Spatial Econom. 15(4):1011–1048.Crossref, Google Scholar
• Khot S (2002) On the power of unique 2-prover 1-round games. Proc. 34th Annual ACM Sympos. Theory Comput. (ACM, New York), 767–775.Google Scholar
• Khot S, Kindler G, Mossel E, O’Donnell R (2007) Optimal inapproximability results for max-cut and other 2-variable CSPS? SIAM J. Comput. 37(1):319–357.Crossref, Google Scholar
• Koppleman F, Wen CH (2000) The paired combinatorial logit model: Properties, estimation and application. Transportation Res. B: Methodological 34(2):75–89.Crossref, Google Scholar
• Kulik A, Shachnai H, Tamir T (2013) Approximations for monotone and nonmonotone submodular maximization with knapsack constraints. Math. Oper. Res. 38(4):729–739.Link, Google Scholar
• Lee J, Mirrokni VS, Nagarajan V, Sviridenko M (2010) Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Math. 23(4):2053–2078.Crossref, Google Scholar
• Lewin M, Livnat D, Zwick U (2002) Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. Cook WJ, Schulz AS, eds. Integer Programming Combinatorial Optim., Lecture Notes in Computer Science, vol. 2337 (Springer, Berlin, Heidelberg), 67–82.Crossref, Google Scholar
• Li H, Webster S (2017) Optimal pricing of correlated product options under the paired combinatorial logit model. Oper. Res. 65:1215–1230.Link, Google Scholar
• McFadden D (1974) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed. Frontiers in Economics (Academic Press, New York), 105–142.Google Scholar
• Rusmevichientong P, Shen ZJM, Shmoys D (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. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.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