{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:55:30Z","timestamp":1777362930758,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T00:00:00Z","timestamp":1749254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T00:00:00Z","timestamp":1749254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"TBD","award":["2"],"award-info":[{"award-number":["2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10107-025-02238-9","type":"journal-article","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T02:31:02Z","timestamp":1749263462000},"page":"177-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assortment optimization with visibility constraints"],"prefix":"10.1007","volume":"216","author":[{"given":"Th\u00e9o","family":"Barr\u00e9","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3097-8571","authenticated-orcid":false,"given":"Omar El","family":"Housni","sequence":"additional","affiliation":[]},{"given":"Marouane Ibn","family":"Brahim","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,7]]},"reference":[{"issue":"1","key":"2238_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/opre.2015.1459","volume":"64","author":"Ayd\u0131n Alptekino\u011flu","year":"2016","unstructured":"Alptekino\u011flu, Ayd\u0131n, Semple, John H.: The exponomial choice model: A new alternative for assortment and price optimization. Operations Research 64(1), 79\u201393 (2016)","journal-title":"Operations Research"},{"issue":"4","key":"2238_CR2","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1287\/mnsc.2022.4464","volume":"69","author":"Ali Aouad","year":"2023","unstructured":"Aouad, Ali, Saban, Daniela: Online assortment optimization for two-sided matching platforms. Management Science 69(4), 2069\u20132087 (2023)","journal-title":"Management Science"},{"issue":"4","key":"2238_CR3","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.2022.2370","volume":"71","author":"Arash Asadpour","year":"2023","unstructured":"Asadpour, Arash, Niazadeh, Rad, Saberi, Amin, Shameli, Ali: Sequential submodular maximization and applications to ranking an assortment of products. Operations Research 71(4), 1154\u20131170 (2023)","journal-title":"Operations Research"},{"issue":"3\u2013part\u20131","key":"2238_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1287\/isre.1110.0391","volume":"23","author":"Kursad Asdemir","year":"2012","unstructured":"Asdemir, Kursad, Kumar, Nanda, Jacob, Varghese S.: Pricing models for online advertising: CPM vs. CPC. Information Systems Research 23(3\u2013part\u20131), 804\u2013822 (2012)","journal-title":"Information Systems Research"},{"issue":"4","key":"2238_CR5","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1287\/opre.2016.1505","volume":"64","author":"Jose Blanchet","year":"2016","unstructured":"Blanchet, Jose, Gallego, Guillermo, Goyal, Vineet: A markov chain approximation to choice modeling. Operations Research 64(4), 886\u2013905 (2016)","journal-title":"Operations Research"},{"key":"2238_CR6","unstructured":"Chen, Qinyi, Golrezaei, Negin, Susan, Fransisca, Baskoro, Edy: Fair assortment planning. arXiv preprint arXiv:2208.07341, (2022)"},{"issue":"6","key":"2238_CR7","doi-asserted-by":"publisher","first-page":"4024","DOI":"10.1287\/mnsc.2021.4044","volume":"68","author":"Mahsa Derakhshan","year":"2022","unstructured":"Derakhshan, Mahsa, Golrezaei, Negin, Manshadi, Vahideh, Mirrokni, Vahab: Product ranking on online platforms. Management Science 68(6), 4024\u20134041 (2022)","journal-title":"Management Science"},{"issue":"2","key":"2238_CR8","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1287\/mnsc.2018.3230","volume":"66","author":"Antoine D\u00e9sir","year":"2020","unstructured":"D\u00e9sir, Antoine, Goyal, Vineet, Segev, Danny, Ye, Chun: Constrained assortment optimization under the markov chain-based choice model. Management Science 66(2), 698\u2013721 (2020)","journal-title":"Management Science"},{"issue":"2","key":"2238_CR9","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1287\/opre.2021.2142","volume":"70","author":"Antoine D\u00e9sir","year":"2022","unstructured":"D\u00e9sir, Antoine, Goyal, Vineet, Zhang, Jiawei: Capacitated assortment optimization: Hardness and approximation. Operations Research 70(2), 893\u2013904 (2022)","journal-title":"Operations Research"},{"issue":"4","key":"2238_CR10","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/opre.2022.2384","volume":"71","author":"Omar El Housni","year":"2023","unstructured":"El Housni, Omar, Topaloglu, Huseyin: Joint assortment optimization and customization under a mixture of multinomial logit models: On the value of personalized assortments. Operations Research 71(4), 1197\u20131215 (2023)","journal-title":"Operations Research"},{"key":"2238_CR11","doi-asserted-by":"crossref","unstructured":"El\u00a0Housni, Omar, Ibn\u00a0Brahim, Marouane, Segev, Danny: Maximum load assortment optimization: Approximation algorithms and adaptivity gaps. arXiv preprint arXiv:2309.01772, (2023)","DOI":"10.2139\/ssrn.4560530"},{"issue":"10","key":"2238_CR12","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1287\/mnsc.2014.1931","volume":"60","author":"Guillermo Gallego","year":"2014","unstructured":"Gallego, Guillermo, Topaloglu, Huseyin: Constrained assortment optimization for the nested logit model. Management Science 60(10), 2583\u20132601 (2014)","journal-title":"Management Science"},{"key":"2238_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-9606-3","volume-title":"Revenue Management and Pricing Analytics","author":"Guillermo Gallego","year":"2019","unstructured":"Gallego, Guillermo, Topaloglu, Huseyin: Revenue Management and Pricing Analytics. Springer (2019)"},{"issue":"1","key":"2238_CR14","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/opre.2014.1328","volume":"63","author":"Guillermo Gallego","year":"2015","unstructured":"Gallego, Guillermo, Ratliff, Richard, Shebalov, Sergey: A general attraction model and sales-based linear program for network revenue management under customer choice. Operations Research 63(1), 212\u2013232 (2015)","journal-title":"Operations Research"},{"issue":"3","key":"2238_CR15","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"Rajiv Gandhi","year":"2006","unstructured":"Gandhi, Rajiv, Khuller, Samir, Parthasarathy, Srinivasan, Srinivasan, Aravind: Dependent rounding and its applications to approximation algorithms. Journal of the ACM 53(3), 324\u2013360 (2006)","journal-title":"Journal of the ACM"},{"issue":"5","key":"2238_CR16","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1287\/opre.2021.2127","volume":"69","author":"Pin Gao","year":"2021","unstructured":"Gao, Pin, Ma, Yuhang, Chen, Ningyuan, Gallego, Guillermo, Li, Anran, Rusmevichientong, Paat, Topaloglu, Huseyin: Assortment optimization and pricing under the multinomial logit model with impatient customers: Sequential recommendation and selection. Operations Research 69(5), 1509\u20131532 (2021)","journal-title":"Operations Research"},{"issue":"4","key":"2238_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"Michael R Garey","year":"1975","unstructured":"Garey, Michael R., Johnson, David S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 4(4), 397\u2013411 (1975)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"2238_CR18","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1287\/mnsc.2014.1939","volume":"60","author":"Negin Golrezaei","year":"2014","unstructured":"Golrezaei, Negin, Nazerzadeh, Hamid, Rusmevichientong, Paat: Real-time optimization of personalized assortments. Management Science 60(6), 1532\u20131551 (2014)","journal-title":"Management Science"},{"issue":"5","key":"2238_CR19","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.2307\/1910997","volume":"52","author":"Jerry Hausman","year":"1984","unstructured":"Hausman, Jerry, McFadden, Daniel: Specification tests for the multinomial logit model. Econometrica 52(5), 1219\u201340 (1984)","journal-title":"Econometrica"},{"key":"2238_CR20","doi-asserted-by":"crossref","unstructured":"K\u00f6k, A\u00a0G\u00fcrhan, Fisher, Marshall\u00a0L, Vaidyanathan, Ramnath: Assortment planning: Review of literature and industry practice. Retail supply chain management: Quantitative models and empirical studies, pages 175\u2013236, (2015)","DOI":"10.1007\/978-1-4899-7562-1_8"},{"issue":"4","key":"2238_CR21","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1287\/opre.2023.2469","volume":"71","author":"Sumit Kunnumkal","year":"2023","unstructured":"Kunnumkal, Sumit: New bounds for cardinality-constrained assortment optimization under the nested logit model. Operations Research 71(4), 1112\u20131119 (2023)","journal-title":"Operations Research"},{"issue":"2","key":"2238_CR22","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1287\/ijoc.2022.0262","volume":"36","author":"Markus Leitner","year":"2024","unstructured":"Leitner, Markus, Lodi, Andrea, Roberti, Roberto, Sole, Claudio: An exact method for (constrained) assortment optimization problems with product costs. INFORMS Journal on Computing 36(2), 479\u2013494 (2024)","journal-title":"INFORMS Journal on Computing"},{"key":"2238_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1111\/j.1937-5956.2007.tb00265.x","volume":"16","author":"Zhaolin Li","year":"2009","unstructured":"Li, Zhaolin: A single-period assortment optimization model. Production and Operations Management 16, 369\u2013380 (2009)","journal-title":"Production and Operations Management"},{"key":"2238_CR24","unstructured":"Lu, Wentao, Sahin, Ozge, Wang, Ruxian: A simple way towards fair assortment planning: Algorithms and welfare implications. Available at SSRN 4514495, (2023)"},{"key":"2238_CR25","volume-title":"Individual Choice Behavior","author":"R Duncan Luce","year":"1959","unstructured":"Luce, R Duncan: Individual Choice Behavior. John Wiley (1959)"},{"issue":"3","key":"2238_CR26","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1287\/opre.49.3.334.11210","volume":"49","author":"Siddharth Mahajan","year":"2001","unstructured":"Mahajan, Siddharth, Van Ryzin, Garrett: Stocking retail assortments under dynamic consumer substitution. Operations Research 49(3), 334\u2013351 (2001)","journal-title":"Operations Research"},{"key":"2238_CR27","unstructured":"McFadden, Daniel: Conditional logit analysis of qualitative choice behavior. Frontiers in Econometrics, pages 105\u2013142, (1973)"},{"issue":"2","key":"2238_CR28","first-page":"525","volume":"23","author":"Sentao Miao","year":"2021","unstructured":"Miao, Sentao, Chao, Xiuli: Dynamic joint assortment and pricing optimization with demand learning. Manufacturing & Service Operations Management 23(2), 525\u2013545 (2021)","journal-title":"Manufacturing & Service Operations Management"},{"issue":"2","key":"2238_CR29","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"Alessandro Panconesi","year":"1997","unstructured":"Panconesi, Alessandro, Srinivasan, Aravind: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM Journal on Computing 26(2), 350\u2013368 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"2238_CR30","doi-asserted-by":"publisher","first-page":"1666","DOI":"10.1287\/opre.1100.0866","volume":"58","author":"Paat Rusmevichientong","year":"2010","unstructured":"Rusmevichientong, Paat, Shen, Zuo-Jun Max., Shmoys, David B.: Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Operations Research 58(6), 1666\u20131680 (2010)","journal-title":"Operations Research"},{"issue":"11","key":"2238_CR31","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1111\/poms.12191","volume":"23","author":"Paat Rusmevichientong","year":"2014","unstructured":"Rusmevichientong, Paat, Shmoys, David, Tong, Chaoxu, Topaloglu, Huseyin: Assortment optimization under the multinomial logit model with random choice parameters. Production and Operations Management 23(11), 2023\u20132039 (2014)","journal-title":"Production and Operations Management"},{"key":"2238_CR32","doi-asserted-by":"crossref","unstructured":"Segev, Danny, Singla, Sahil: Efficient approximation schemes for stochastic probing and prophet problems. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 793\u2013794, (2021)","DOI":"10.1145\/3465456.3467614"},{"issue":"5","key":"2238_CR33","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1287\/mnsc.2020.3657","volume":"67","author":"Mika Sumida","year":"2021","unstructured":"Sumida, Mika, Gallego, Guillermo, Rusmevichientong, Paat, Topaloglu, Huseyin, Davis, James: Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Science 67(5), 2845\u20132869 (2021)","journal-title":"Management Science"},{"issue":"1","key":"2238_CR34","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","volume":"50","author":"Kalyan Talluri","year":"2004","unstructured":"Talluri, Kalyan, Van Ryzin, Garrett: Revenue management under a general discrete choice model of consumer behavior. Management Science 50(1), 15\u201333 (2004)","journal-title":"Management Science"},{"key":"2238_CR35","volume-title":"Discrete choice methods with simulation","author":"Kenneth E Train","year":"2009","unstructured":"Train, Kenneth E.: Discrete choice methods with simulation. Cambridge University Press (2009)"},{"key":"2238_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Chenhao, Wang, Yao, Tang, Shaojie: When advertising meets assortment planning: Joint advertising and assortment optimization under multinomial logit model. In International Conference on Combinatorial Optimization and Applications, pages 16\u201342, (2023)","DOI":"10.1007\/978-3-031-49614-1_2"},{"issue":"6","key":"2238_CR37","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.orl.2012.08.003","volume":"40","author":"Ruxian Wang","year":"2012","unstructured":"Wang, Ruxian: Capacitated assortment and price optimization under the multinomial logit model. Operations Research Letters 40(6), 492\u2013497 (2012)","journal-title":"Operations Research Letters"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02238-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02238-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02238-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:11:44Z","timestamp":1777360304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02238-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,7]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2238"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02238-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,7]]},"assertion":[{"value":"29 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}