Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model

References

• Abeliuk A, Berbeglia G, Cebrian M, Van Hentenryck P (2016) Assortment optimization under a multinomial logit model with position bias and social influence. 4OR 14(1):57–75.Crossref, Google Scholar
• Adams WP, Forrester RJ, Glover FW (2004) Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discrete Optim. 1(2):99–120.Crossref, Google Scholar
• Aggarwal N, Bansal A, Manglik K, Kulkarni K, Raykar V (2020) Hyper-local sustainable assortment planning. Preprint, submitted July 27, https://arxiv.org/abs/2007.13414.Google Scholar
• Alfandari L, Hassanzadeh A, Ljubić I (2021) An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291(3):830–845.Crossref, Google Scholar
• Aouad A, Farias V, Levi R (2021) Assortment optimization under consider-then-choose choice models. Management Sci. 67(6):3368–3386.Link, Google Scholar
• Aouad A, Levi R, Segev D (2018a) 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 (2018b) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
• Bertsimas D, Mišić VV (2019) Exact first-choice product line optimization. Oper. Res. 67(3):651–670.Link, 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.Link, Google Scholar
• Cao Y, Kleywegt AJ, Wang H (2022a) Network revenue management under a spiked multinomial logit choice model. Oper. Res. 70(4):2237–2253.Link, Google Scholar
• Cao Y, Rusmevichientong P, Topaloglu H (2022b) Revenue management under a mixture of independent demand and multinomial logit models. Oper. Res. 71(2):603–625.Link, Google Scholar
• Chen R, Jiang H (2020) Assortment optimization with position effects under the nested logit model. Naval Res. Logist. 67(1):21–33.Crossref, 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:68–77.Crossref, 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
• Désir A, Goyal V, Zhang J (2022) Capacitated assortment optimization: Hardness and approximation. Oper. Res. 70(2):893–904.Link, Google Scholar
• Dinkelbach W (1967) On nonlinear fractional programming. Management Sci. 13(7):492–498.Link, Google Scholar
• Feldman J (2017) Space constrained assortment optimization under the paired combinatorial logit model. Preprint, submitted August 5, https://doi.org/10.2139/ssrn.3013321.Google Scholar
• Feldman J, Topaloglu H (2015a) Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Production Oper. Management 24(10):1598–1620.Crossref, Google Scholar
• Feldman JB, Topaloglu H (2015b) Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Feng J, Che A, Chen ZL (2026) Assortment optimization with general linear constraints under the paired combinatorial logit choice model. https://doi.org/10.1287/ijoc.2024.0830.cd, https://github.com/INFORMSJoC/2024.0830.Google Scholar
• Forrester RJ, Hunt-Isaak N (2020) Computational comparison of exact solution methods for 0-1 quadratic programs: Recommendations for practitioners. J. Appl. Math. 2020:(1–21).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, Iyengar G, Phillips R, Dubey A (2020) Managing flexible products on a network. Preprint, submitted April 27, https://doi.org/10.2139/ssrn.3567371.Google Scholar
• Ghuge R, Kwon J, Nagarajan V, Sharma A (2022) Constrained assortment optimization under the paired combinatorial logit model. Oper. Res. 70(2):786–804.Link, Google Scholar
• Kabadi SN, Punnen AP (2008) A strongly polynomial simplex method for the linear fractional assignment problem. Oper. Res. Lett. 36(4):402–407.Crossref, Google Scholar
• Karoonsoontawong A, Lin DY (2015) Combined gravity model trip distribution and paired combinatorial logit stochastic user equilibrium problem. Network Spatial Econom. 15(4):1011–1048.Crossref, Google Scholar
• Koppelman FS, Wen CH (2000) The paired combinatorial logit model: Properties, estimation and application. Transportation Res. Part B: Methodological 34(2):75–89.Crossref, Google Scholar
• Kunnumkal S (2015) On upper bounds for assortment optimization under the mixture of multinomial logit models. Oper. Res. Lett. 43(2):189–194.Crossref, Google Scholar
• Kunnumkal S, Martínez-de Albéniz V (2019) Tractable approximations for assortment planning with product costs. Oper. Res. 67(2):436–452.Abstract, Google Scholar
• Le C, Mai T (2024) Constrained assortment optimization under the cross-nested logit model. Production Oper. Management 33(10):2073–2090.Crossref, Google Scholar
• Leitner M, Lodi A, Roberti R, Sole C (2023) An exact method for (constrained) assortment optimization problems with product costs. INFORMS J. Comput. 36(2):479–494.Google Scholar
• Li G, Rusmevichientong P (2014) A greedy algorithm for the two-level nested logit model. Oper. Res. Lett. 42(5):319–324.Crossref, Google Scholar
• Li H, Webster S (2017) Optimal pricing of correlated product options under the paired combinatorial logit model. Oper. Res. 65(5):1215–1230.Link, 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 G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Lo V, Topaloglu H (2022) Omnichannel assortment optimization under the multinomial logit model with a features tree. Manufacturing Service Oper. Management 24(2):1220–1240.Link, Google Scholar
• Megiddo N (1978) Combinatorial optimization with rational objective functions. Proc. 10th Annual ACM Sympos on Theory Comput., (Association for Computing Machinery, New York), 1–12.Google Scholar
• Méndez-Díaz I, Miranda-Bront JJ, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. (1979) 164:246–263.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Oliveira G (2022) Assortment optimization under the multi-choice rank list model: Practical application at CurveCatch. MS thesis, Universidade Católica Portuguesa, Portugal.Google Scholar
• Prashker JN, Bekhor S (1998) Investigation of stochastic network loading procedures. Transporation Res. Rec. 1645(1):94–102.Crossref, Google Scholar
• Radzik T (1998) Fractional combinatorial optimization. Du D-Z, Pardalos PM, eds. Handbook of Combinatorial Optimization (Springer, Boston), 429–478.Crossref, Google Scholar
• Rusmevichientong P, Shen ZJM, Shmoys DB (2009) A ptas for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37(4):230–238.Crossref, Google 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.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
• Segev D (2022) Approximation schemes for capacity-constrained assortment optimization under the nested logit model. Oper. Res. 70(5):2820–2836.Link, Google Scholar
• Şen A, Atamtürk A, Kaminsky P (2018) A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4):994–1003.Link, Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2021) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.Link, 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
• Volinskiy D, Bergstrom JC, Cornwell CM, Holmes TP (2010) A pseudo-sequential choice model for valuing multi-attribute environmental policies or programs in contingent valuation applications. Agriculture Resources Econom. Rev. 39(1):9–21.Crossref, Google Scholar
• Wang R (2013) Assortment management under the generalized attraction model with a capacity constraint. J. Revenue Pricing Management 12(3):254–270.Crossref, Google Scholar
• Wang R (2021) Discrete choice models and applications in operations management. Carlsson JG, ed. Emerging Optimization Methods and Modeling Techniques with Applications, INFORMS Tutorials in Operations Research (INFORMS, Catonsville, MD), 199–226.Google Scholar
• Wang H, Kochenberger G, Glover F (2012) A computational study on the quadratic knapsack problem with multiple constraints. Comput. Oper. Res. 39(1):3–11.Crossref, Google Scholar
• Wang MJ, Wen CH, Lan LW (2010) Modelling different types of bundled automobile insurance choice behaviour: The case of Taiwan. Geneva Papers Risk Insurance-Issues Practice 35:290–308.Crossref, Google Scholar
• Xie T, Ge D (2018) A tractable discrete fractional programming: Application to constrained assortment optimization. J. Combinatorial Optim. 36(2):400–415.Crossref, Google Scholar
• Zhang L, Azadeh SS, Jiang H (2025) Exact and heuristic algorithms for cardinality-constrained assortment optimization problem under the cross-nested logit model. Eur. J. Oper. Res. 324(1):183–199.Crossref, 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