{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:46:58Z","timestamp":1780321618320,"version":"3.54.1"},"reference-count":184,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t Augsburg"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Assortment optimization is a core topic of demand management that finds application in a broad set of different areas including retail, airline, hotel, and transportation industries as well as in the healthcare sector. Hence, the interest in research on assortment optimization has grown rapidly in recent years. However, the sheer number of publications on the topic of assortment optimization makes it difficult to keep track of all available approaches proposed in the literature. In this paper, we systematically review state-of-the-art studies on assortment optimization. We assemble an extensive literature overview by strategically searching for pre-defined keywords within leading scientific databases. The resulting literature is grouped by a proposed taxonomy that captures properties related to the optimization problem itself, the modelled customer behaviour, and the solution concept applied for solving the problem at hand. For each group, we provide an overview of the corresponding literature and analyse it based on a proposed selection of key factors.<\/jats:p>","DOI":"10.1007\/s00291-024-00752-4","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:02:53Z","timestamp":1713290573000},"page":"1099-1161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Assortment optimization: a systematic literature review"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1212-9182","authenticated-orcid":false,"given":"Julia","family":"Heger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-2984","authenticated-orcid":false,"given":"Robert","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"issue":"5","key":"752_CR1","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/opre.2018.1832","volume":"67","author":"S Agrawal","year":"2019","unstructured":"Agrawal S, Avadhanula V, Goyal V, Zeevi A (2019) MNL-bandit: a dynamic learning approach to assortment selection. Oper Res 67(5):1453\u20131485. https:\/\/doi.org\/10.1287\/opre.2018.1832","journal-title":"Oper Res"},{"issue":"1","key":"752_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jeconom.2009.09.007","volume":"156","author":"V Aguirregabiria","year":"2010","unstructured":"Aguirregabiria V, Mira P (2010) Dynamic discrete choice structural models: a survey. J Econom 156(1):38\u201367. https:\/\/doi.org\/10.1016\/j.jeconom.2009.09.007","journal-title":"J Econom"},{"issue":"4","key":"752_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2022.04.002","volume":"50","author":"A Ahmed","year":"2022","unstructured":"Ahmed A, Sohoni M, Bandi C (2022) Parameterized approximations for the two-sided assortment optimization. Oper Res Lett 50(4):399\u2013406. https:\/\/doi.org\/10.1016\/j.orl.2022.04.002","journal-title":"Oper Res Lett"},{"issue":"3","key":"752_CR4","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ejor.2020.12.007","volume":"291","author":"L Alfandari","year":"2021","unstructured":"Alfandari L, Hassanzadeh A, Ljubi\u0107 I (2021) An exact method for assortment optimization under the nested logit model. Eur J Oper Res 291(3):830\u2013845. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.007","journal-title":"Eur J Oper Res"},{"issue":"1","key":"752_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/opre.2015.1459","volume":"64","author":"A Alptekino\u011flu","year":"2016","unstructured":"Alptekino\u011flu A, Semple JH (2016) The exponomial choice model: a new alternative for assortment and price optimization. Oper Res 64(1):79\u201393. https:\/\/doi.org\/10.1287\/opre.2015.1459","journal-title":"Oper Res"},{"issue":"3","key":"752_CR6","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.2020.2074","volume":"69","author":"A Alptekino\u011flu","year":"2021","unstructured":"Alptekino\u011flu A, Semple JH (2021) Heteroscedastic exponomial choice. Oper Res 69(3):841\u2013858. https:\/\/doi.org\/10.1287\/opre.2020.2074","journal-title":"Oper Res"},{"issue":"2","key":"752_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/moor.2018.0933","volume":"44","author":"A Aouad","year":"2018","unstructured":"Aouad A, Levi R, Segev D (2018a) Approximation algorithms for dynamic assortment optimization models. Math Oper Res 44(2):487\u2013511. https:\/\/doi.org\/10.1287\/moor.2018.0933","journal-title":"Math Oper Res"},{"issue":"5","key":"752_CR8","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1287\/opre.2018.1734","volume":"66","author":"A Aouad","year":"2018","unstructured":"Aouad A, Levi R, Segev D (2018b) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Oper Res 66(5):1321\u20131345. https:\/\/doi.org\/10.1287\/opre.2018.1734","journal-title":"Oper Res"},{"issue":"6","key":"752_CR9","doi-asserted-by":"publisher","first-page":"3368","DOI":"10.1287\/mnsc.2020.3681","volume":"67","author":"A Aouad","year":"2020","unstructured":"Aouad A, Farias V, Levi R (2020) Assortment optimization under consider-then-choose choice models. Manag Sci 67(6):3368\u20133386. https:\/\/doi.org\/10.1287\/mnsc.2020.3681","journal-title":"Manag Sci"},{"key":"752_CR12","doi-asserted-by":"publisher","unstructured":"Aouad A, Feldman J, Segev D, Zhang D (2021) The click-based MNL model: a novel framework for modeling click data in assortment optimization. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3340620","DOI":"10.2139\/ssrn.3340620"},{"issue":"5","key":"752_CR10","doi-asserted-by":"publisher","first-page":"2814","DOI":"10.1287\/mnsc.2022.4492","volume":"69","author":"A Aouad","year":"2022","unstructured":"Aouad A, Feldman J, Segev D (2022) The exponomial choice model for assortment optimization: an alternative to the MNL model? Manag Sci 69(5):2814\u20132832. https:\/\/doi.org\/10.1287\/mnsc.2022.4492","journal-title":"Manag Sci"},{"issue":"2","key":"752_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ejor.2012.11.006","volume":"226","author":"F Aros-Vera","year":"2013","unstructured":"Aros-Vera F, Marianov V, Mitchell JE (2013) p-Hub approach for the optimal park-and-ride facility location problem. Eur J Oper Res 226(2):277\u2013285. https:\/\/doi.org\/10.1016\/j.ejor.2012.11.006","journal-title":"Eur J Oper Res"},{"key":"752_CR11","doi-asserted-by":"publisher","unstructured":"Aouad A, D\u00e9sir A (2022) Representing random utility choice models with neural networks. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2207.12877","DOI":"10.48550\/arXiv.2207.12877"},{"issue":"5","key":"752_CR14","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1287\/opre.2022.2327","volume":"70","author":"I Ashlagi","year":"2022","unstructured":"Ashlagi I, Krishnaswamy AK, Makhijani R, Saban D, Shiragur K (2022) Technical note\u2014assortment planning for two-sided sequential matching markets. Oper Res 70(5):2784\u20132803. https:\/\/doi.org\/10.1287\/opre.2022.2327","journal-title":"Oper Res"},{"issue":"2","key":"752_CR15","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1287\/opre.2019.1888","volume":"68","author":"A Atamt\u00fcrk","year":"2020","unstructured":"Atamt\u00fcrk A, G\u00f3mez A (2020) Submodularity in conic quadratic mixed 0\u20131 optimization. Oper Res 68(2):609\u2013630. https:\/\/doi.org\/10.1287\/opre.2019.1888","journal-title":"Oper Res"},{"key":"752_CR16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2023.2463","author":"Y Bai","year":"2023","unstructured":"Bai Y, Feldman J, Segev D, Topaloglu H, Wagner L (2023a) Assortment optimization under the multi-purchase multinomial logit choice model. Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/opre.2023.2463","journal-title":"Oper Res Articles Adv"},{"key":"752_CR17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.0060","author":"Y Bai","year":"2023","unstructured":"Bai Y, Feldman J, Topaloglu H, Wagner L (2023b) Assortment optimization under the multinomial logit model with utility-based rank cutoffs. Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/opre.2021.0060","journal-title":"Oper Res Articles Adv"},{"key":"752_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s43069-021-00056-1","volume":"2","author":"G Bechler","year":"2021","unstructured":"Bechler G, Steinhardt C, Mackert J (2021) On the linear integration of attraction choice models in business optimization problems. Oper Res Forum 2:12. https:\/\/doi.org\/10.1007\/s43069-021-00056-1","journal-title":"Oper Res Forum"},{"key":"752_CR19","volume-title":"Discrete choice analysis: theory and application to travel demand","author":"ME Ben-Akiva","year":"1985","unstructured":"Ben-Akiva ME, Lerman SR (1985) Discrete choice analysis: theory and application to travel demand. MIT press series in transportation studies, MIT Press, Cambridge"},{"key":"752_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF00999209","volume":"5","author":"M Ben-Akiva","year":"1994","unstructured":"Ben-Akiva M et al (1994) Combining revealed and stated preferences data. Mark Lett 5:335\u2013349. https:\/\/doi.org\/10.1007\/BF00999209","journal-title":"Mark Lett"},{"issue":"3","key":"752_CR21","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","volume":"143","author":"S Benati","year":"2002","unstructured":"Benati S, Hansen P (2002) The maximum capture problem with random utilities: problem formulation and algorithms. Eur J Oper Res 143(3):518\u2013530. https:\/\/doi.org\/10.1016\/S0377-2217(01)00340-X","journal-title":"Eur J Oper Res"},{"issue":"2","key":"752_CR22","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.orl.2016.01.009","volume":"44","author":"G Berbeglia","year":"2016","unstructured":"Berbeglia G (2016) Discrete choice models based on random walks. Oper Res Lett 44(2):234\u2013237. https:\/\/doi.org\/10.1016\/j.orl.2016.01.009","journal-title":"Oper Res Lett"},{"issue":"6","key":"752_CR23","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1287\/mnsc.2021.4069","volume":"68","author":"G Berbeglia","year":"2021","unstructured":"Berbeglia G, Garassino A, Vulcano G (2021a) A comparative empirical study of discrete choice models in retail operations. Manage Sci 68(6):4005\u20134023. https:\/\/doi.org\/10.1287\/mnsc.2021.4069","journal-title":"Manage Sci"},{"key":"752_CR24","doi-asserted-by":"publisher","unstructured":"Berbeglia G, Flores A, Gallego G (2021b) Refined assortment optimization. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3778413","DOI":"10.2139\/ssrn.3778413"},{"issue":"4","key":"752_CR25","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/msom.2015.0544","volume":"17","author":"F Bernstein","year":"2015","unstructured":"Bernstein F, K\u00f6k AG, Xie L (2015) Dynamic assortment customization with limited inventories. Manuf Serv Oper Manag 17(4):538\u2013553. https:\/\/doi.org\/10.1287\/msom.2015.0544","journal-title":"Manuf Serv Oper Manag"},{"issue":"5","key":"752_CR26","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1287\/mnsc.2018.3031","volume":"65","author":"F Bernstein","year":"2019","unstructured":"Bernstein F, Modaresi S, Saur\u00e9 D (2019) A dynamic clustering approach to data-driven assortment personalization. Manag Sci 65(5):2095\u20132115. https:\/\/doi.org\/10.1287\/mnsc.2018.3031","journal-title":"Manag Sci"},{"key":"752_CR27","doi-asserted-by":"publisher","unstructured":"Bernstein F, Modaresi S, Saur\u00e9 D (2022) Exploration optimization for dynamic assortment personalization under linear preferences. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4115721","DOI":"10.2139\/ssrn.4115721"},{"key":"752_CR28","unstructured":"Bertsimas D, Mi\u0161i\u0107 V (2015) Data-driven assortment optimization. Working paper, MIT Sloan School of Management, Cambridge, MA"},{"issue":"1","key":"752_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/msom.2015.0548","volume":"18","author":"O Besbes","year":"2015","unstructured":"Besbes O, Gur Y, Zeevi A (2015) Optimization in online content recommendation services: beyond click-through rates. Manuf Serv Oper Manag 18(1):15\u201333. https:\/\/doi.org\/10.1287\/msom.2015.0548","journal-title":"Manuf Serv Oper Manag"},{"issue":"4","key":"752_CR30","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1287\/opre.2016.1505","volume":"64","author":"J Blanchet","year":"2016","unstructured":"Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper Res 64(4):886\u2013905. https:\/\/doi.org\/10.1287\/opre.2016.1505","journal-title":"Oper Res"},{"issue":"4","key":"752_CR31","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/msom.1050.0088","volume":"7","author":"GP Cachon","year":"2005","unstructured":"Cachon GP, Terwiesch C, Xu Y (2005) Retail assortment planning in the presence of consumer search. Manuf Serv Oper Manag 7(4):330\u2013346. https:\/\/doi.org\/10.1287\/msom.1050.0088","journal-title":"Manuf Serv Oper Manag"},{"key":"752_CR32","doi-asserted-by":"publisher","unstructured":"Cai Z, Wang H, Talluri K, Li X (2022) Deep learning for choice modeling. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2208.09325","DOI":"10.48550\/arXiv.2208.09325"},{"key":"752_CR33","unstructured":"Campbell BM (1969) The existence of evoked set and determinants of its magnitude in brand choice behavior. Ph.D. thesis, Columbia University"},{"issue":"2","key":"752_CR34","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/opre.2022.2333","volume":"71","author":"Y Cao","year":"2022","unstructured":"Cao Y, Rusmevichientong P, Topaloglu H (2022) Revenue management under a mixture of independent demand and multinomial logit models. Oper Res 71(2):603\u2013625. https:\/\/doi.org\/10.1287\/opre.2022.2333","journal-title":"Oper Res"},{"issue":"2","key":"752_CR35","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/mnsc.1060.0613","volume":"53","author":"F Caro","year":"2007","unstructured":"Caro F, Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Manag Sci 53(2):276\u2013292. https:\/\/doi.org\/10.1287\/mnsc.1060.0613","journal-title":"Manag Sci"},{"issue":"11","key":"752_CR36","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1287\/mnsc.2014.1991","volume":"60","author":"F Caro","year":"2014","unstructured":"Caro F, Mart\u00ednez-de Alb\u00e9niz V, Rusmevichientong P (2014) The assortment packing problem: multiperiod assortment planning for short-lived products. Manag Sci 60(11):2701\u20132721. https:\/\/doi.org\/10.1287\/mnsc.2014.1991","journal-title":"Manag Sci"},{"key":"752_CR37","doi-asserted-by":"publisher","unstructured":"Chen Y-C, Mi\u0161i\u0107 V (2021) Assortment optimization under the decision forest model. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3812654","DOI":"10.2139\/ssrn.3812654"},{"issue":"1","key":"752_CR38","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/nav.21879","volume":"67","author":"R Chen","year":"2020","unstructured":"Chen R, Jiang H (2020a) Assortment optimization with position effects under the nested logit model. Nav Res Logist 67(1):21\u201333. https:\/\/doi.org\/10.1002\/nav.21879","journal-title":"Nav Res Logist"},{"key":"752_CR39","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s10898-020-00896-x","volume":"7","author":"R Chen","year":"2020","unstructured":"Chen R, Jiang H (2020b) Capacitated assortment and price optimization under the nested logit model. J Global Optim 7:895\u2013918. https:\/\/doi.org\/10.1007\/s10898-020-00896-x","journal-title":"J Global Optim"},{"issue":"1","key":"752_CR40","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1111\/poms.13258","volume":"30","author":"X Chen","year":"2021","unstructured":"Chen X, Shi C, Wang Y, Zhou Y (2021a) Dynamic assortment planning under nested logit model. Prod Oper Manag 30(1):85\u2013102. https:\/\/doi.org\/10.1111\/poms.13258","journal-title":"Prod Oper Manag"},{"issue":"3","key":"752_CR41","doi-asserted-by":"publisher","first-page":"1923","DOI":"10.1287\/mnsc.2020.3772","volume":"68","author":"X Chen","year":"2021","unstructured":"Chen X, Owen Z, Pixton C, Simchi-Levi D (2021b) A statistical learning approach to personalization in revenue management. Manag Sci 68(3):1923\u20131937. https:\/\/doi.org\/10.1287\/mnsc.2020.3772","journal-title":"Manag Sci"},{"key":"752_CR43","doi-asserted-by":"publisher","unstructured":"Chen X, Li J, Li M, Zhao T, Zhou Y (2022) Assortment optimization under the multivariate MNL model. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2209.15220","DOI":"10.48550\/arXiv.2209.15220"},{"key":"752_CR42","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.0281","author":"X Chen","year":"2023","unstructured":"Chen X, Krishnamurthy A, Wang Y (2023a) Robust dynamic assortment optimization in the presence of outlier customers. Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/opre.2020.0281","journal-title":"Oper Res Articles Adv"},{"key":"752_CR44","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.1357","author":"X Chen","year":"2023","unstructured":"Chen X, Ma W, Simchi-Levi D, Xin L (2023b) Assortment planning for recommendations at checkout under inventory constraints. Math Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/moor.2023.1357","journal-title":"Math Oper Res Articles Adv"},{"key":"752_CR45","doi-asserted-by":"publisher","unstructured":"Cheung WC, Simchi-Levi D (2017) Thompson sampling for online personalized assortment optimization problems with multinomial logit choice models. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3075658","DOI":"10.2139\/ssrn.3075658"},{"issue":"2","key":"752_CR46","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.2014.1256","volume":"62","author":"J Davis","year":"2014","unstructured":"Davis J, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper Res 62(2):250\u2013273. https:\/\/doi.org\/10.1287\/opre.2014.1256","journal-title":"Oper Res"},{"key":"752_CR47","unstructured":"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"},{"issue":"1","key":"752_CR48","first-page":"186","volume":"50","author":"G Debreu","year":"1960","unstructured":"Debreu G (1960) Review of Individual choice behavior: a theoretical analysis by R.D. Luce. Am Econ Rev 50(1):186\u2013188","journal-title":"Am Econ Rev"},{"issue":"1","key":"752_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc: Ser B (Methodol) 39(1):1\u201322. https:\/\/doi.org\/10.1111\/j.2517-6161.1977.tb01600.x","journal-title":"J R Stat Soc: Ser B (Methodol)"},{"issue":"2","key":"752_CR50","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1287\/mnsc.2018.3230","volume":"66","author":"A D\u00e9sir","year":"2019","unstructured":"D\u00e9sir A, Goyal V, Segev D, Ye C (2019) Constrained assortment optimization under the Markov chain-based choice model. Manag Sci 66(2):698\u2013721. https:\/\/doi.org\/10.1287\/mnsc.2018.3230","journal-title":"Manag Sci"},{"issue":"4","key":"752_CR51","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1287\/opre.2020.2085","volume":"69","author":"A D\u00e9sir","year":"2021","unstructured":"D\u00e9sir A, Goyal V, Jagabathula S, Segev D (2021) Mallows-smoothed distribution over rankings approach for modeling choice. Oper Res 69(4):1206\u20131227. https:\/\/doi.org\/10.1287\/opre.2020.2085","journal-title":"Oper Res"},{"key":"752_CR52","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2420","author":"A D\u00e9sir","year":"2023","unstructured":"D\u00e9sir A, Goyal V, Jiang B, Xie T, Zhang J (2023) Robust assortment optimization under the Markov chain choice model. Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/opre.2022.2420","journal-title":"Oper Res Articles Adv"},{"key":"752_CR53","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/bf01545586","volume":"19","author":"W Domschke","year":"1997","unstructured":"Domschke W, Krispin G (1997) Location and layout planning. OR Spectrum 19:181\u2013194. https:\/\/doi.org\/10.1007\/bf01545586","journal-title":"OR Spectrum"},{"key":"752_CR54","doi-asserted-by":"publisher","unstructured":"Dong J, et al. (2023) PASTA: Pessimistic assortment optimization. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2302.03821","DOI":"10.48550\/arXiv.2302.03821"},{"key":"752_CR55","doi-asserted-by":"publisher","unstructured":"Doudchenko N, Drynkin E (2020) Estimation of discrete choice models: a machine learning approach. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2010.08016","DOI":"10.48550\/arXiv.2010.08016"},{"issue":"4","key":"752_CR56","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1111\/jscm.12145","volume":"53","author":"CF Durach","year":"2017","unstructured":"Durach CF, Kembro J, Wieland A (2017) A new paradigm for systematic literature reviews in supply chain management. J Supply Chain Manag 53(4):67\u201385. https:\/\/doi.org\/10.1111\/jscm.12145","journal-title":"J Supply Chain Manag"},{"issue":"4","key":"752_CR57","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/opre.2022.2384","volume":"71","author":"O El Housni","year":"2022","unstructured":"El Housni O, Topaloglu H (2022) Joint assortment optimization and customization under a mixture of multinomial logit models: on the value of personalized assortments. Oper Res 71(4):1197\u20131215. https:\/\/doi.org\/10.1287\/opre.2022.2384","journal-title":"Oper Res"},{"issue":"3","key":"752_CR58","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/msom.2018.0756","volume":"22","author":"M Ettl","year":"2019","unstructured":"Ettl M, Harsha P, Papush A, Perakis G (2019) A data-driven approach to personalized bundle pricing and recommendation. Manuf Serv Oper Manag 22(3):461\u2013480. https:\/\/doi.org\/10.1287\/msom.2018.0756","journal-title":"Manuf Serv Oper Manag"},{"key":"752_CR59","doi-asserted-by":"publisher","unstructured":"Feldman J (2017) Technical note: space constrained assortment optimization under the paired combinatorial logit model. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3013321","DOI":"10.2139\/ssrn.3013321"},{"issue":"5","key":"752_CR60","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1111\/poms.12983","volume":"28","author":"J Feldman","year":"2019","unstructured":"Feldman J, Paul A (2019) Relating the approximability of the fixed cost and space constrained assortment problems. Prod Oper Manag 28(5):1238\u20131255. https:\/\/doi.org\/10.1111\/poms.12983","journal-title":"Prod Oper Manag"},{"issue":"4","key":"752_CR61","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1287\/opre.2021.2218","volume":"70","author":"J Feldman","year":"2022","unstructured":"Feldman J, Segev D (2022) Technical note\u2014the multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays. Oper Res 70(4):2162\u20132184. https:\/\/doi.org\/10.1287\/opre.2021.2218","journal-title":"Oper Res"},{"issue":"10","key":"752_CR62","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1111\/poms.12365","volume":"24","author":"J Feldman","year":"2015","unstructured":"Feldman J, Topaloglu H (2015a) Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits. Prod Oper Manag 24(10):1598\u20131620. https:\/\/doi.org\/10.1111\/poms.12365","journal-title":"Prod Oper Manag"},{"issue":"4","key":"752_CR63","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1287\/opre.2015.1383","volume":"63","author":"J Feldman","year":"2015","unstructured":"Feldman J, Topaloglu H (2015b) Capacity constraints across nests in assortment optimization under the nested logit model. Oper Res 63(4):812\u2013822. https:\/\/doi.org\/10.1287\/opre.2015.1383","journal-title":"Oper Res"},{"issue":"5","key":"752_CR64","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1287\/opre.2017.1628","volume":"65","author":"J Feldman","year":"2017","unstructured":"Feldman J, Topaloglu H (2017a) Revenue management under the Markov chain choice model. Oper Res 65(5):1322\u20131342. https:\/\/doi.org\/10.1287\/opre.2017.1628","journal-title":"Oper Res"},{"issue":"2","key":"752_CR65","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1287\/opre.2017.1672","volume":"66","author":"J Feldman","year":"2017","unstructured":"Feldman J, Topaloglu H (2017b) Technical note\u2014capacitated assortment optimization under the multinomial logit model with nested consideration sets. Oper Res 66(2):380\u2013391. https:\/\/doi.org\/10.1287\/opre.2017.1672","journal-title":"Oper Res"},{"issue":"5","key":"752_CR66","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1287\/opre.2018.1803","volume":"67","author":"J Feldman","year":"2019","unstructured":"Feldman J, Paul A, Topaloglu H (2019) Technical note\u2014assortment optimization with small consideration sets. Oper Res 67(5):1283\u20131299. https:\/\/doi.org\/10.1287\/opre.2018.1803","journal-title":"Oper Res"},{"issue":"1","key":"752_CR67","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.2021.2158","volume":"70","author":"J Feldman","year":"2021","unstructured":"Feldman J, Zhang D, Liu X, Zhang N (2021) Customer choice models vs. machine learning: finding optimal product displays on Alibaba. Oper Res 70(1):309\u2013328. https:\/\/doi.org\/10.1287\/opre.2021.2158","journal-title":"Oper Res"},{"key":"752_CR68","doi-asserted-by":"publisher","unstructured":"Feng Q, Wang Z (2021) Dynamic multinomial logit choice model with network effect. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3939717","DOI":"10.2139\/ssrn.3939717"},{"issue":"3","key":"752_CR69","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1016\/j.ejor.2018.08.047","volume":"273","author":"A Flores","year":"2019","unstructured":"Flores A, Berbeglia G, Van Hentenryck P (2019) Assortment optimization under the sequential multinomial logit model. Eur J Oper Res 273(3):1052\u20131064. https:\/\/doi.org\/10.1016\/j.ejor.2018.08.047","journal-title":"Eur J Oper Res"},{"issue":"10","key":"752_CR70","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1287\/mnsc.2014.1931","volume":"60","author":"G Gallego","year":"2014","unstructured":"Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Manag Sci 60(10):2583\u20132601. https:\/\/doi.org\/10.1287\/mnsc.2014.1931","journal-title":"Manag Sci"},{"key":"752_CR71","doi-asserted-by":"publisher","unstructured":"Gallego G, Berbeglia G (2022) Bounds, heuristics, and prophet inequalities for assortment optimization. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2109.14861","DOI":"10.48550\/arXiv.2109.14861"},{"key":"752_CR72","doi-asserted-by":"publisher","unstructured":"Gallego G, Iravani MM, Talebian M (2023) Constrained assortment optimization with satisficers consumers. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4402473","DOI":"10.2139\/ssrn.4402473"},{"key":"752_CR73","doi-asserted-by":"publisher","unstructured":"Gallego G, Lu W (2021) An optimal greedy heuristic with minimal learning regret for the Markov chain choice model. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3810470","DOI":"10.2139\/ssrn.3810470"},{"key":"752_CR74","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-1-4939-9606-3_5","volume-title":"Revenue management and pricing analytics, Ch. 5","author":"G Gallego","year":"2019","unstructured":"Gallego G, Topaloglu H (2019) Revenue management and pricing analytics, Ch. 5. Springer, New York, pp 129\u2013160"},{"issue":"5","key":"752_CR75","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1287\/opre.2021.2127","volume":"69","author":"P Gao","year":"2021","unstructured":"Gao P et al (2021) Assortment optimization and pricing under the multinomial logit model with impatient customers: sequential recommendation and selection. Oper Res 69(5):1509\u20131532. https:\/\/doi.org\/10.1287\/opre.2021.2127","journal-title":"Oper Res"},{"issue":"2","key":"752_CR76","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1287\/opre.2021.2188","volume":"70","author":"R Ghuge","year":"2021","unstructured":"Ghuge R, Kwon J, Nagarajan V, Sharma A (2021) Constrained assortment optimization under the paired combinatorial logit model. Oper Res 70(2):786\u2013804. https:\/\/doi.org\/10.1287\/opre.2021.2188","journal-title":"Oper Res"},{"issue":"6","key":"752_CR77","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1287\/mnsc.2014.1939","volume":"60","author":"N Golrezaei","year":"2014","unstructured":"Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Manag Sci 60(6):1532\u20131551. https:\/\/doi.org\/10.1287\/mnsc.2014.1939","journal-title":"Manag Sci"},{"issue":"7","key":"752_CR78","doi-asserted-by":"publisher","first-page":"4772","DOI":"10.1287\/mnsc.2021.4134","volume":"68","author":"X-Y Gong","year":"2021","unstructured":"Gong X-Y et al (2021) Online assortment optimization with reusable resources. Manag Sci 68(7):4772\u20134785. https:\/\/doi.org\/10.1287\/mnsc.2021.4134","journal-title":"Manag Sci"},{"key":"752_CR79","doi-asserted-by":"publisher","unstructured":"Goutam K, Goyal V, Lam H (2020) Assortment optimization over dense universe is easy. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3649233","DOI":"10.2139\/ssrn.3649233"},{"issue":"5","key":"752_CR80","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.omega.2012.10.008","volume":"41","author":"K Haase","year":"2013","unstructured":"Haase K, M\u00fcller S (2013) Management of school locations allowing for free school choice. Omega 41(5):847\u2013855. https:\/\/doi.org\/10.1016\/j.omega.2012.10.008","journal-title":"Omega"},{"issue":"3","key":"752_CR81","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ejor.2013.08.009","volume":"232","author":"K Haase","year":"2014","unstructured":"Haase K, M\u00fcller S (2014) A comparison of linear reformulations for multinomial logit choice probabilities in facility location models. Eur J Oper Res 232(3):689\u2013691. https:\/\/doi.org\/10.1016\/j.ejor.2013.08.009","journal-title":"Eur J Oper Res"},{"key":"752_CR82","first-page":"745","volume-title":"Facility location in the public sector","author":"K Haase","year":"2019","unstructured":"Haase K, Kn\u00f6rr L, Krohn R, M\u00fcller S, Wagner M (2019) Facility location in the public sector. Springer, Cham, pp 745\u2013764"},{"key":"752_CR83","doi-asserted-by":"publisher","unstructured":"Haase K, M\u00fcller S (2020) Constrained assortment optimization under the mixed logit model with design options. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3624816","DOI":"10.2139\/ssrn.3624816"},{"key":"752_CR84","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.trb.2022.07.001","volume":"163","author":"Y Han","year":"2022","unstructured":"Han Y, Pereira F, Ben-Akiva M, Zegras C (2022) A neural-embedded discrete choice model: learning taste representation with strengthened interpretability. Transp Res Part B: Methodol 163:166\u2013186. https:\/\/doi.org\/10.1016\/j.trb.2022.07.001","journal-title":"Transp Res Part B: Methodol"},{"issue":"1","key":"752_CR85","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ejor.2006.06.025","volume":"181","author":"MA Hariga","year":"2007","unstructured":"Hariga MA, Al-Ahmari A, Mohamed A-RA (2007) A joint optimisation model for inventory replenishment, product assortment, shelf space and display area allocation decisions. Eur J Oper Res 181(1):239\u2013251. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.025","journal-title":"Eur J Oper Res"},{"issue":"3","key":"752_CR86","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1177\/1536867X0200200301","volume":"2","author":"F Heiss","year":"2002","unstructured":"Heiss F (2002) Structural choice analysis with nested logit models. Stata J 2(3):227\u2013252. https:\/\/doi.org\/10.1177\/1536867X0200200301","journal-title":"Stata J"},{"key":"752_CR87","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511610356","volume-title":"Applied choice analysis: a primer","author":"DA Hensher","year":"2005","unstructured":"Hensher DA, Rose JM, Greene WH (2005) Applied choice analysis: a primer. Cambridge University Press, Cambridge"},{"key":"752_CR88","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0682-2","volume-title":"Computability and complexity theory. Texts in computer science","author":"S Homer","year":"2011","unstructured":"Homer S, Selman AL (2011) Computability and complexity theory. Texts in computer science. Springer, New York"},{"issue":"5","key":"752_CR89","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1287\/opre.1090.0805","volume":"58","author":"D Honhon","year":"2010","unstructured":"Honhon D, Gaur V, Seshadri S (2010) Assortment planning and inventory decisions under stockout-based substitution. Oper Res 58(5):1364\u20131379. https:\/\/doi.org\/10.1287\/opre.1090.0805","journal-title":"Oper Res"},{"issue":"2","key":"752_CR90","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1287\/msom.1110.0365","volume":"14","author":"D Honhon","year":"2012","unstructured":"Honhon D, Jonnalagedda S, Pan XA (2012) Optimal algorithms for assortment selection under ranking-based consumer choice models. Manuf Serv Oper Manag 14(2):279\u2013289. https:\/\/doi.org\/10.1287\/msom.1110.0365","journal-title":"Manuf Serv Oper Manag"},{"issue":"3","key":"752_CR91","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2020.03.005","volume":"48","author":"D Honhon","year":"2020","unstructured":"Honhon D, Pan XA, Sreelata J (2020) In-out algorithm for assortment planning under a ranking-based consumer choice model. Oper Res Lett 48(3):309\u2013316. https:\/\/doi.org\/10.1016\/j.orl.2020.03.005","journal-title":"Oper Res Lett"},{"key":"752_CR92","volume-title":"The theory of buyer behavior","author":"J Howard","year":"1969","unstructured":"Howard J, Sheth J (1969) The theory of buyer behavior. Wiley, New York"},{"issue":"2","key":"752_CR93","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.omega.2011.05.008","volume":"40","author":"A H\u00fcbner","year":"2012","unstructured":"H\u00fcbner A, Kuhn H (2012) Retail category management: state-of-the-art review of quantitative research and software applications in assortment and shelf space management. Omega 40(2):199\u2013209. https:\/\/doi.org\/10.1016\/j.omega.2011.05.008","journal-title":"Omega"},{"issue":"1","key":"752_CR94","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ejor.2017.01.039","volume":"261","author":"A H\u00fcbner","year":"2017","unstructured":"H\u00fcbner A, Schaal K (2017) An integrated assortment and shelf-space optimization model with demand substitution and space-elasticity effects. Eur J Oper Res 261(1):302\u2013316. https:\/\/doi.org\/10.1016\/j.ejor.2017.01.039","journal-title":"Eur J Oper Res"},{"issue":"3","key":"752_CR95","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1111\/poms.13111","volume":"29","author":"A H\u00fcbner","year":"2020","unstructured":"H\u00fcbner A, Sch\u00e4fer F, Schaal K (2020) Maximizing profit via assortment and shelf-space optimization for two-dimensional shelves. Prod Oper Manag 29(3):547\u2013570. https:\/\/doi.org\/10.1111\/poms.13111","journal-title":"Prod Oper Manag"},{"key":"752_CR96","doi-asserted-by":"publisher","unstructured":"Hu B, Jin Q, Long D (2022) Robust assortment revenue optimization and satisficing. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4045001","DOI":"10.2139\/ssrn.4045001"},{"key":"752_CR97","doi-asserted-by":"publisher","unstructured":"Jagabathula S (2016) Assortment optimization under general choice. SSRN. https:\/\/doi.org\/10.2139\/ssrn.2512831","DOI":"10.2139\/ssrn.2512831"},{"issue":"9","key":"752_CR98","doi-asserted-by":"publisher","first-page":"3128","DOI":"10.1287\/mnsc.2016.2491","volume":"63","author":"S Jagabathula","year":"2016","unstructured":"Jagabathula S, Rusmevichientong P (2016) A nonparametric joint assortment and price choice model. Manag Sci 63(9):3128\u20133145. https:\/\/doi.org\/10.1287\/mnsc.2016.2491","journal-title":"Manag Sci"},{"key":"752_CR99","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.0006","author":"S Jagabathula","year":"2023","unstructured":"Jagabathula S, Mitrofanov D, Vulcano G (2023) Demand estimation under uncertain consideration sets. Oper Res Articles Adv. https:\/\/doi.org\/10.1287\/opre.2022.0006","journal-title":"Oper Res Articles Adv"},{"issue":"4","key":"752_CR100","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/ijoo.2019.0037","volume":"2","author":"SD Jena","year":"2020","unstructured":"Jena SD, Lodi A, Palmer H, Sole C (2020) A partially ranked choice model for large-scale data-driven assortment optimization. INFORMS J Optim 2(4):297\u2013319. https:\/\/doi.org\/10.1287\/ijoo.2019.0037","journal-title":"INFORMS J Optim"},{"key":"752_CR101","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-022-00438-0","author":"S Jiang","year":"2022","unstructured":"Jiang S, Nip K-M (2022) An enhanced conic reformulation for capacity-constrained assortment optimization under the mixture of multinomial logit model. J Oper Res Soc China. https:\/\/doi.org\/10.1007\/s40305-022-00438-0","journal-title":"J Oper Res Soc China"},{"issue":"9","key":"752_CR102","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1080\/07408170590917011","volume":"37","author":"J Jiao","year":"2005","unstructured":"Jiao J, Zhang Y (2005) Product portfolio planning with customer-engineering interaction. IIE Trans 37(9):801\u2013814. https:\/\/doi.org\/10.1080\/07408170590917011","journal-title":"IIE Trans"},{"key":"752_CR103","doi-asserted-by":"publisher","unstructured":"Jin Q, Wang Q, Han Y (2023) Pricing and assortment optimization under logit based choice models with tree structured consideration sets. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4129238","DOI":"10.2139\/ssrn.4129238"},{"issue":"4","key":"752_CR104","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1287\/opre.2019.1948","volume":"68","author":"N Kallus","year":"2020","unstructured":"Kallus N, Udell M (2020) Dynamic assortment personalization in high dimensions. Oper Res 68(4):1020\u20131037. https:\/\/doi.org\/10.1287\/opre.2019.1948","journal-title":"Oper Res"},{"key":"752_CR105","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-33003-7_3","volume-title":"Operational research in business and economics","author":"M Karampatsa","year":"2017","unstructured":"Karampatsa M, Grigoroudis E, Matsatsinis NF (2017) Retail category management: a review on assortment and shelf-space planning models. In: Grigoroudis E, Doumpos M (eds) Operational research in business and economics. Springer, Cham, pp 35\u201367"},{"key":"752_CR106","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.omega.2014.02.002","volume":"46","author":"A Katsifou","year":"2014","unstructured":"Katsifou A, Seifert R, Tancrez J-S (2014) Joint product assortment, inventory and price optimization to attract loyal and non-loyal customers. Omega 46:36\u201350. https:\/\/doi.org\/10.1016\/j.omega.2014.02.002","journal-title":"Omega"},{"issue":"1","key":"752_CR107","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.red.2008.07.001","volume":"12","author":"MP Keane","year":"2009","unstructured":"Keane MP, Wolpin KI (2009) Empirical applications of discrete choice dynamic programming models. Rev Econ Dyn 12(1):1\u201322. https:\/\/doi.org\/10.1016\/j.red.2008.07.001","journal-title":"Rev Econ Dyn"},{"issue":"1","key":"752_CR108","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162(1):4\u201329. https:\/\/doi.org\/10.1016\/j.ejor.2003.10.031","journal-title":"Eur J Oper Res"},{"key":"752_CR109","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-0-387-78902-6_6","volume-title":"Retail supply chain management: quantitative models and empirical studies","author":"AG K\u00f6k","year":"2008","unstructured":"K\u00f6k AG, Fisher ML, Vaidyanathan R (2008) Assortment planning: review of literature and industry practice. In: Agrawal N, Smith SA (eds) Retail supply chain management: quantitative models and empirical studies. Springer, Boston, pp 99\u2013153"},{"issue":"2","key":"752_CR110","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0191-2615(99)00012-0","volume":"34","author":"F Koppelman","year":"2000","unstructured":"Koppelman F, Wen C-H (2000) The paired combinatorial logit model: properties, estimation and application. Transp Res Part B: Methodol 34(2):75\u201389. https:\/\/doi.org\/10.1016\/S0191-2615(99)00012-0","journal-title":"Transp Res Part B: Methodol"},{"issue":"2","key":"752_CR111","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.orl.2015.01.010","volume":"43","author":"S Kunnumkal","year":"2015","unstructured":"Kunnumkal S (2015) On upper bounds for assortment optimization under the mixture of multinomial logit models. Oper Res Lett 43(2):189\u2013194. https:\/\/doi.org\/10.1016\/j.orl.2015.01.010","journal-title":"Oper Res Lett"},{"issue":"2","key":"752_CR112","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/opre.2018.1771","volume":"67","author":"S Kunnumkal","year":"2019","unstructured":"Kunnumkal S, Mart\u00ednez-de-Alb\u00e9niz V (2019) Tractable approximations for assortment planning with product costs. Oper Res 67(2):436\u2013452. https:\/\/doi.org\/10.1287\/opre.2018.1771","journal-title":"Oper Res"},{"key":"752_CR113","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocm.2020.100226","author":"G Lederrey","year":"2021","unstructured":"Lederrey G, Lurkin V, Hillel T, Bierlaire M (2021) Estimation of discrete choice models with hybrid stochastic adaptive batch size algorithms. J Choice Model. https:\/\/doi.org\/10.1016\/j.jocm.2020.100226","journal-title":"J Choice Model"},{"key":"752_CR114","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.0262","author":"M Leitner","year":"2023","unstructured":"Leitner M, Lodi A, Roberti R, Sole C (2023) An exact method for (constrained) assortment optimization problems with product costs. INFORMS J Comput Articles Adv. https:\/\/doi.org\/10.1287\/ijoc.2022.0262","journal-title":"INFORMS J Comput Articles Adv"},{"issue":"5","key":"752_CR115","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.orl.2019.07.010","volume":"47","author":"X Li","year":"2019","unstructured":"Li X, Ke J (2019) Robust assortment optimization using worst-case CVaR under the multinomial logit model. Oper Res Lett 47(5):452\u2013457. https:\/\/doi.org\/10.1016\/j.orl.2019.07.010","journal-title":"Oper Res Lett"},{"issue":"2","key":"752_CR116","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1287\/opre.2015.1355","volume":"63","author":"G Li","year":"2015","unstructured":"Li G, Rusmevichientong P, Topaloglu H (2015) The d-level nested logit model: assortment and price optimization problems. Oper Res 63(2):325\u2013342. https:\/\/doi.org\/10.1287\/opre.2015.1355","journal-title":"Oper Res"},{"issue":"3","key":"752_CR117","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1287\/ijoc.2019.0910","volume":"32","author":"N Liu","year":"2020","unstructured":"Liu N, Ma Y, Topaloglu H (2020) Assortment optimization under the multinomial logit model with sequential offerings. INFORMS J Comput 32(3):835\u2013853. https:\/\/doi.org\/10.1287\/ijoc.2019.0910","journal-title":"INFORMS J Comput"},{"issue":"2","key":"752_CR118","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1287\/msom.2021.1001","volume":"24","author":"V Lo","year":"2021","unstructured":"Lo V, Topaloglu H (2021) Omnichannel assortment optimization under the multinomial logit model with a features tree. Manuf Serv Oper Manag 24(2):1220\u20131240. https:\/\/doi.org\/10.1287\/msom.2021.1001","journal-title":"Manuf Serv Oper Manag"},{"key":"752_CR119","volume-title":"Individual choice behavior: a theoretical analysis. Dover books on mathematics","author":"R Luce","year":"2012","unstructured":"Luce R (2012) Individual choice behavior: a theoretical analysis. Dover books on mathematics. Dover Publications, New York"},{"issue":"3","key":"752_CR120","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1287\/opre.49.3.334.11210","volume":"49","author":"S Mahajan","year":"2001","unstructured":"Mahajan S, van Ryzin G (2001) Stocking retail assortments under dynamic consumer substitution. Oper Res 49(3):334\u2013351. https:\/\/doi.org\/10.1287\/opre.49.3.334.11210","journal-title":"Oper Res"},{"key":"752_CR121","doi-asserted-by":"publisher","unstructured":"Maragheh R et al (2021) Choice modeling and assortment optimization in the presence of context effects. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3747354","DOI":"10.2139\/ssrn.3747354"},{"issue":"7","key":"752_CR122","doi-asserted-by":"publisher","first-page":"5049","DOI":"10.1287\/mnsc.2021.4149","volume":"68","author":"V Mart\u00ednez-de Alb\u00e9niz","year":"2022","unstructured":"Mart\u00ednez-de Alb\u00e9niz V, Kunnumkal S (2022) A model for integrated inventory and assortment planning. Manag Sci 68(7):5049\u20135067. https:\/\/doi.org\/10.1287\/mnsc.2021.4149","journal-title":"Manag Sci"},{"issue":"7","key":"752_CR123","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.cor.2011.08.023","volume":"39","author":"MH McElreath","year":"2012","unstructured":"McElreath MH, Mayorga ME (2012) A dynamic programming approach to solving the assortment planning problem with multiple quality levels. Comput Oper Res 39(7):1521\u20131529. https:\/\/doi.org\/10.1016\/j.cor.2011.08.023","journal-title":"Comput Oper Res"},{"issue":"10","key":"752_CR124","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1016\/j.cor.2010.01.011","volume":"37","author":"MH McElreath","year":"2010","unstructured":"McElreath MH, Mayorga ME, Kurz ME (2010) Metaheuristics for assortment problems with multiple quality levels. Comput Oper Res 37(10):1797\u20131804. https:\/\/doi.org\/10.1016\/j.cor.2010.01.011","journal-title":"Comput Oper Res"},{"key":"752_CR125","unstructured":"McFadden D (1978) Modelling the choice of residential location. Transp Res Rec 673"},{"key":"752_CR126","first-page":"105","volume-title":"Frontiers in econometrics","author":"D McFadden","year":"1973","unstructured":"McFadden D (1973) Conditional logit analysis of qualitative choice behaviour. In: Zarembka P (ed) Frontiers in econometrics. Academic Press, New York, pp 105\u2013142"},{"issue":"5","key":"752_CR127","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/1099-1255(200009\/10)15:5<447::AID-JAE570>3.0.CO;2-1","volume":"15","author":"D McFadden","year":"2000","unstructured":"McFadden D, Train K (2000) Mixed MNL models for discrete response. J Appl Economet 15(5):447\u2013470. https:\/\/doi.org\/10.1002\/1099-1255(200009\/10)15:5<447::AID-JAE570>3.0.CO;2-1","journal-title":"J Appl Economet"},{"issue":"3","key":"752_CR128","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.ejor.2022.03.033","volume":"303","author":"S Mehrani","year":"2022","unstructured":"Mehrani S, Sefair JA (2022) Robust assortment optimization under sequential product unavailability. Eur J Oper Res 303(3):1027\u20131043. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.033","journal-title":"Eur J Oper Res"},{"issue":"2","key":"752_CR129","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"M Melo","year":"2009","unstructured":"Melo M, Nickel S, Saldanha-da Gama F (2009) Facility location and supply chain management\u2014a review. Eur J Oper Res 196(2):401\u2013412. https:\/\/doi.org\/10.1016\/j.ejor.2008.05.007","journal-title":"Eur J Oper Res"},{"issue":"1","key":"752_CR130","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2012.03.003","volume":"164","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz I, Miranda-Bront JJ, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl Math 164(1):246\u2013263. https:\/\/doi.org\/10.1016\/j.dam.2012.03.003","journal-title":"Discrete Appl Math"},{"issue":"2","key":"752_CR131","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1287\/msom.2019.0857","volume":"23","author":"S Miao","year":"2020","unstructured":"Miao S, Chao X (2020) Dynamic joint assortment and pricing optimization with demand learning. Manuf Serv Oper Manag 23(2):525\u2013545. https:\/\/doi.org\/10.1287\/msom.2019.0857","journal-title":"Manuf Serv Oper Manag"},{"issue":"5","key":"752_CR132","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1287\/msom.2022.1128","volume":"24","author":"S Miao","year":"2022","unstructured":"Miao S, Chao X (2022) Online personalized assortment optimization with high-dimensional customer contextual data. Manuf Serv Oper Manag 24(5):2741\u20132760. https:\/\/doi.org\/10.1287\/msom.2022.1128","journal-title":"Manuf Serv Oper Manag"},{"key":"752_CR133","doi-asserted-by":"publisher","unstructured":"Miao S, Wang Y, Zhang J (2021) A general framework for resource constrained revenue management with demand learning and large action space. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3841273","DOI":"10.2139\/ssrn.3841273"},{"issue":"2","key":"752_CR134","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jretai.2010.02.004","volume":"86","author":"CM Miller","year":"2010","unstructured":"Miller CM, Smith SA, McIntyre SH, Achabal DD (2010) Optimizing and evaluating retail assortments for infrequently purchased products. J Retail 86(2):159\u2013171. https:\/\/doi.org\/10.1016\/j.jretai.2010.02.004","journal-title":"J Retail"},{"issue":"5","key":"752_CR135","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1287\/opre.2019.1928","volume":"68","author":"VV Mi\u0161i\u0107","year":"2020","unstructured":"Mi\u0161i\u0107 VV (2020) Optimization of tree ensembles. Oper Res 68(5):1605\u20131624. https:\/\/doi.org\/10.1287\/opre.2019.1928","journal-title":"Oper Res"},{"issue":"1","key":"752_CR136","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1287\/msom.2019.0805","volume":"22","author":"V Mi\u0161i\u0107","year":"2019","unstructured":"Mi\u0161i\u0107 V, Perakis G (2019) Data analytics in operations management: a review. Manuf Serv Ope Manag 22(1):158\u2013169. https:\/\/doi.org\/10.1287\/msom.2019.0805","journal-title":"Manuf Serv Ope Manag"},{"issue":"3","key":"752_CR137","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2016.03.013","volume":"44","author":"S M\u00fcller","year":"2016","unstructured":"M\u00fcller S, Haase K (2016) On the product portfolio planning problem with customer-engineering interaction. Oper Res Lett 44(3):390\u2013393. https:\/\/doi.org\/10.1016\/j.orl.2016.03.013","journal-title":"Oper Res Lett"},{"key":"752_CR138","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1057\/s41272-020-00279-7","volume":"21","author":"U Mushtaque","year":"2022","unstructured":"Mushtaque U, Pazour J (2022) Assortment optimization under cardinality effects and novelty for unequal profit margin items. J Revenue Pricing Manag 21:106\u2013126. https:\/\/doi.org\/10.1057\/s41272-020-00279-7","journal-title":"J Revenue Pricing Manag"},{"issue":"7","key":"752_CR139","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1111\/poms.13358","volume":"30","author":"K Nip","year":"2021","unstructured":"Nip K, Wang Z, Wang Z (2021) Assortment optimization under a single transition choice model. Prod Oper Manag 30(7):2122\u20132142. https:\/\/doi.org\/10.1111\/poms.13358","journal-title":"Prod Oper Manag"},{"issue":"3","key":"752_CR140","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/msom.2017.0662","volume":"20","author":"A Paul","year":"2018","unstructured":"Paul A, Feldman J, Davis J (2018) Assortment optimization and pricing under a nonparametric tree choice model. Manuf Serv Oper Manag 20(3):550\u2013565. https:\/\/doi.org\/10.1287\/msom.2017.0662","journal-title":"Manuf Serv Oper Manag"},{"issue":"7","key":"752_CR141","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1002\/nav.22068","volume":"69","author":"Y Peeters","year":"2022","unstructured":"Peeters Y, den Boer AV (2022) Stochastic approximation for uncapacitated assortment optimization under the multinomial logit model. Nav Res Logist 69(7):927\u2013938. https:\/\/doi.org\/10.1002\/nav.22068","journal-title":"Nav Res Logist"},{"issue":"3","key":"752_CR142","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1287\/opre.2021.2235","volume":"70","author":"Y Peeters","year":"2022","unstructured":"Peeters Y, den Boer AV, Mandjes M (2022) Continuous assortment optimization with logit choice probabilities and incomplete information. Oper Res 70(3):1613\u20131628. https:\/\/doi.org\/10.1287\/opre.2021.2235","journal-title":"Oper Res"},{"key":"752_CR143","doi-asserted-by":"publisher","unstructured":"Peng Z, Rong Y, Zhu T (2022) When to sacrifice prediction accuracy: machine learning or MNL choice model for assortment planning. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4298996","DOI":"10.2139\/ssrn.4298996"},{"key":"752_CR144","unstructured":"Perakis G, Thayaparan L (2023) UMOTEM: upper bounding method for optimizing over tree ensemble models. SSRN. https:\/\/ssrn.com\/abstract=3972341"},{"issue":"8","key":"752_CR145","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1002\/nav.21949","volume":"67","author":"M Qi","year":"2020","unstructured":"Qi M, Mak H-Y, Shen Z-JM (2020) Data-driven research in retail operations\u2014a review. Nav Res Logist 67(8):595\u2013616. https:\/\/doi.org\/10.1002\/nav.21949","journal-title":"Nav Res Logist"},{"key":"752_CR146","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jretconser.2020.102152","volume":"56","author":"J Qiu","year":"2020","unstructured":"Qiu J, Li X, Duan Y, Chen M, Tian P (2020) Dynamic assortment in the presence of brand heterogeneity. J Retail Consum Serv 56:102\u2013152. https:\/\/doi.org\/10.1016\/j.jretconser.2020.102152","journal-title":"J Retail Consum Serv"},{"issue":"4","key":"752_CR147","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1287\/msom.2022.1107","volume":"25","author":"I Rios","year":"2022","unstructured":"Rios I, Saban D, Zheng F (2022) Improving match rates in dating markets through assortment optimization. Manuf Serv Oper Manag 25(4):1304\u20131323. https:\/\/doi.org\/10.1287\/msom.2022.1107","journal-title":"Manuf Serv Oper Manag"},{"issue":"4","key":"752_CR148","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.1120.1063","volume":"60","author":"P Rusmevichientong","year":"2012","unstructured":"Rusmevichientong P, Topaloglu H (2012) Robust assortment optimization in revenue management under the multinomial logit choice model. Oper Res 60(4):865\u2013882. https:\/\/doi.org\/10.1287\/opre.1120.1063","journal-title":"Oper Res"},{"issue":"6","key":"752_CR149","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1287\/opre.1100.0866","volume":"58","author":"P Rusmevichientong","year":"2010","unstructured":"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\u20131680. https:\/\/doi.org\/10.1287\/opre.1100.0866","journal-title":"Oper Res"},{"issue":"11","key":"752_CR150","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1111\/poms.12191","volume":"23","author":"P Rusmevichientong","year":"2014","unstructured":"Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Prod Oper Manag 23(11):2023\u20132039. https:\/\/doi.org\/10.1111\/poms.12191","journal-title":"Prod Oper Manag"},{"issue":"7","key":"752_CR151","doi-asserted-by":"publisher","first-page":"2820","DOI":"10.1287\/mnsc.2019.3346","volume":"66","author":"P Rusmevichientong","year":"2020","unstructured":"Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Manage Sci 66(7):2820\u20132844. https:\/\/doi.org\/10.1287\/mnsc.2019.3346","journal-title":"Manage Sci"},{"issue":"1","key":"752_CR152","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.ejor.2010.01.012","volume":"206","author":"C Sch\u00f6n","year":"2010","unstructured":"Sch\u00f6n C (2010a) On the product line selection problem under attraction choice models of consumer behavior. Eur J Oper Res 206(1):260\u2013264. https:\/\/doi.org\/10.1016\/j.ejor.2010.01.012","journal-title":"Eur J Oper Res"},{"issue":"5","key":"752_CR153","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1287\/mnsc.1100.1160","volume":"56","author":"C Sch\u00f6n","year":"2010","unstructured":"Sch\u00f6n C (2010b) On the optimal product line selection problem with price discrimination. Manage Sci 56(5):896\u2013902. https:\/\/doi.org\/10.1287\/mnsc.1100.1160","journal-title":"Manage Sci"},{"key":"752_CR154","unstructured":"Schuurman P, Woeginger GJ (2009) Approximation schemes \u2013 a tutorial. In: M\u00f6hring R, Potts C, Schulz A, Woeginger G, Wolsey L (eds) Lectures on Scheduling"},{"key":"752_CR155","doi-asserted-by":"publisher","unstructured":"Schwamberger J, Fleischmann M, Strauss A (2023) Tractable time slot assortment optimization in attended home delivery under consider-then-choose customer choice. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4351741","DOI":"10.2139\/ssrn.4351741"},{"issue":"4","key":"752_CR156","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1287\/opre.2017.1703","volume":"66","author":"A \u015een","year":"2018","unstructured":"\u015een A, Atamt\u00fcrk A, Kaminsky P (2018) Technical note\u2014a conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper Res 66(4):994\u20131003. https:\/\/doi.org\/10.1287\/opre.2017.1703","journal-title":"Oper Res"},{"key":"752_CR157","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.trb.2020.08.006","volume":"140","author":"B Sifringer","year":"2020","unstructured":"Sifringer B, Lurkin V, Alahi A (2020) Enhancing discrete choice models with representation learning. Transportation Research Part B: Methodological 140:236\u2013261. https:\/\/doi.org\/10.1016\/j.trb.2020.08.006","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"752_CR158","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1287\/opre.2017.1692","volume":"66","author":"S \u015eim\u015fek","year":"2018","unstructured":"\u015eim\u015fek S, Topaloglu H (2018) Technical note\u2014an expectation-maximization algorithm to estimate the parameters of the Markov chain choice model. Oper Res 66(3):748\u2013760. https:\/\/doi.org\/10.1287\/opre.2017.1692","journal-title":"Oper Res"},{"issue":"2","key":"752_CR159","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ejor.2018.01.011","volume":"271","author":"AK Strauss","year":"2018","unstructured":"Strauss AK, Klein R, Steinhardt C (2018) A review of choice-based revenue management: theory and methods. Eur J Oper Res 271(2):375\u2013387. https:\/\/doi.org\/10.1016\/j.ejor.2018.01.011","journal-title":"Eur J Oper Res"},{"issue":"5","key":"752_CR160","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1287\/mnsc.2020.3657","volume":"67","author":"M Sumida","year":"2020","unstructured":"Sumida M, Gallego G, Rusmevichientong P, Huseyin T, Davis J (2020) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Manage Sci 67(5):2845\u20132869. https:\/\/doi.org\/10.1287\/mnsc.2020.3657","journal-title":"Manage Sci"},{"issue":"1","key":"752_CR161","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"K Talluri","year":"2004","unstructured":"Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Manage Sci 50(1):15\u201333. https:\/\/doi.org\/10.1287\/mnsc.1030.0147","journal-title":"Manage Sci"},{"issue":"5","key":"752_CR162","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1080\/09537287.2015.1129464","volume":"27","author":"AMT Thom\u00e9","year":"2016","unstructured":"Thom\u00e9 AMT, Scavarda LF, Scavarda AJ (2016) Conducting systematic literature review in operations management. Prod Plan Control 27(5):408\u2013420. https:\/\/doi.org\/10.1080\/09537287.2015.1129464","journal-title":"Prod Plan Control"},{"key":"752_CR163","doi-asserted-by":"publisher","unstructured":"Torrico A, Carvalho M, Lodi A (2021) Multi-agent assortment optimization in sequential matching markets. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2006.04313","DOI":"10.48550\/arXiv.2006.04313"},{"key":"752_CR164","volume-title":"Discrete choice methods with simulation","author":"KE Train","year":"2009","unstructured":"Train KE (2009) Discrete choice methods with simulation, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"issue":"1","key":"752_CR165","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.ejor.2021.09.041","volume":"301","author":"S Transchel","year":"2022","unstructured":"Transchel S, Buisman M, Haijema R (2022) Joint assortment and inventory optimization for vertically differentiated products under consumer-driven substitution. Eur J Oper Res 301(1):163\u2013179. https:\/\/doi.org\/10.1016\/j.ejor.2021.09.041","journal-title":"Eur J Oper Res"},{"issue":"2","key":"752_CR166","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ejor.2021.08.006","volume":"300","author":"T Tulabandhula","year":"2022","unstructured":"Tulabandhula T, Sinha D, Karra S (2022) Optimizing revenue while showing relevant assortments at scale. Eur J Oper Res 300(2):561\u2013570. https:\/\/doi.org\/10.1016\/j.ejor.2021.08.006","journal-title":"Eur J Oper Res"},{"issue":"6","key":"752_CR167","doi-asserted-by":"publisher","first-page":"2298","DOI":"10.1287\/msom.2020.0238","volume":"25","author":"T Tulabandhula","year":"2023","unstructured":"Tulabandhula T, Sinha D, Karra S, Patidar P (2023) Multi-purchase behavior: modeling, estimation, and optimization. Manuf Serv Oper Manag 25(6):2298\u20132313. https:\/\/doi.org\/10.1287\/msom.2020.0238","journal-title":"Manuf Serv Oper Manag"},{"key":"752_CR168","doi-asserted-by":"publisher","unstructured":"Udwani R (2021) Submodular order functions and assortment optimization. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2107.02743","DOI":"10.48550\/arXiv.2107.02743"},{"key":"752_CR169","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.jocm.2021.100340","volume":"42","author":"S van Cranenburgh","year":"2022","unstructured":"van Cranenburgh S, Wang S, Vij A, Pereira F, Walker J (2022) Choice modelling in the age of machine learning\u2014discussion paper. J Choice Model 42:1003. https:\/\/doi.org\/10.1016\/j.jocm.2021.100340","journal-title":"J Choice Model"},{"issue":"3","key":"752_CR170","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/msom.2017.0688","volume":"20","author":"R Wang","year":"2018","unstructured":"Wang R (2018) When prospect theory meets consumer choice models: assortment and pricing management with reference prices. Manuf Serv Oper Manag 20(3):583\u2013600. https:\/\/doi.org\/10.1287\/msom.2017.0688","journal-title":"Manuf Serv Oper Manag"},{"issue":"4","key":"752_CR171","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1287\/opre.2020.2059","volume":"69","author":"R Wang","year":"2021","unstructured":"Wang R (2021) Technical note\u2014consumer choice and market expansion: modeling, optimization, and estimation. Oper Res 69(4):1044\u20131056. https:\/\/doi.org\/10.1287\/opre.2020.2059","journal-title":"Oper Res"},{"issue":"8","key":"752_CR172","doi-asserted-by":"publisher","first-page":"3649","DOI":"10.1287\/mnsc.2017.2790","volume":"64","author":"R Wang","year":"2017","unstructured":"Wang R, Sahin O (2017) The impact of consumer search cost on assortment planning and pricing. Manag Sci 64(8):3649\u20133666. https:\/\/doi.org\/10.1287\/mnsc.2017.2790","journal-title":"Manag Sci"},{"issue":"11","key":"752_CR173","doi-asserted-by":"publisher","first-page":"3944","DOI":"10.1287\/mnsc.2016.2520","volume":"63","author":"R Wang","year":"2016","unstructured":"Wang R, Wang Z (2016) Consumer choice models with endogenous network effects. Manag Sci 63(11):3944\u20133960. https:\/\/doi.org\/10.1287\/mnsc.2016.2520","journal-title":"Manag Sci"},{"key":"752_CR176","doi-asserted-by":"publisher","unstructured":"Wang S, Mo B, Hess S, Zhao J (2021) Comparing hundreds of machine learning classifiers and discrete choice models in predicting travel behavior: an empirical benchmark. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2102.01130","DOI":"10.48550\/arXiv.2102.01130"},{"key":"752_CR177","doi-asserted-by":"publisher","unstructured":"Wang C, Wang Y, Tang S (2022a) When advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3908616","DOI":"10.2139\/ssrn.3908616"},{"key":"752_CR181","doi-asserted-by":"publisher","unstructured":"Wang R, Zhao Z, Ke C (2022b) Modeling consumer choice and optimizing assortment under the threshold multinomial logit model. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4184044","DOI":"10.2139\/ssrn.4184044"},{"key":"752_CR174","doi-asserted-by":"publisher","unstructured":"Wang H, Cai Z, Li X, Talluri K (2023a) A neural network based choice model for assortment optimization. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2308.05617","DOI":"10.48550\/arXiv.2308.05617"},{"key":"752_CR175","doi-asserted-by":"publisher","unstructured":"Wang H, Li X, Talluri K (2023b) Transformer choice net: a transformer neural network for choice prediction. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2310.08716","DOI":"10.48550\/arXiv.2310.08716"},{"key":"752_CR178","doi-asserted-by":"publisher","unstructured":"Wang X, Wei M, Yao T (2023c) Online assortment optimization with high-dimensional data. SSRN. https:\/\/doi.org\/10.2139\/ssrn.3521843","DOI":"10.2139\/ssrn.3521843"},{"key":"752_CR179","doi-asserted-by":"publisher","unstructured":"Wang M, Zhang X, Li X (2023d) Multiple-purchase choice model: estimation and optimization. Int J Prod Econ 265. https:\/\/doi.org\/10.1016\/j.ijpe.2023.109010","DOI":"10.1016\/j.ijpe.2023.109010"},{"key":"752_CR180","doi-asserted-by":"publisher","unstructured":"Wang M, Zhang H, Rusmevichientong P, Shen Z-JM (2023e) Optimizing offline product design and online assortment policy: measuring the relative impact of each decision. SSRN. https:\/\/doi.org\/10.2139\/ssrn.4090147","DOI":"10.2139\/ssrn.4090147"},{"key":"752_CR182","doi-asserted-by":"crossref","unstructured":"Whitley D (2013) Sharpened and Focused No Free Lunch and Complexity Theory, Ch. 16 in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, 451\u2013476 Springer New York, NY","DOI":"10.1007\/978-1-4614-6940-7_16"},{"key":"752_CR183","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s10878-018-0302-x","volume":"36","author":"T Xie","year":"2018","unstructured":"Xie T, Ge D (2018) A tractable discrete fractional programming: application to constrained assortment optimization. J Comb Optim 36:400\u2013415. https:\/\/doi.org\/10.1007\/s10878-018-0302-x","journal-title":"J Comb Optim"},{"issue":"3","key":"752_CR184","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.2019.1930","volume":"68","author":"H Zhang","year":"2020","unstructured":"Zhang H, Rusmevichientong P, Topaloglu H (2020) Assortment optimization under the paired combinatorial logit model. Oper Res 68(3):741\u2013761. https:\/\/doi.org\/10.1287\/opre.2019.1930","journal-title":"Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00752-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00752-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00752-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T07:17:02Z","timestamp":1729754222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00752-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,16]]},"references-count":184,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["752"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00752-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,16]]},"assertion":[{"value":"16 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}