{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T17:06:26Z","timestamp":1773335186763,"version":"3.50.1"},"reference-count":54,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.11.004","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T02:25:27Z","timestamp":1762482327000},"page":"257-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8356-3180","authenticated-orcid":false,"given":"Hoang","family":"Giang Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3263-5003","authenticated-orcid":false,"given":"Tien","family":"Mai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0001","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.ejor.2020.12.007","article-title":"An exact method for assortment optimization under the nested logit model","volume":"291","author":"Alfandari","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.004_bib0002","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1287\/opre.2018.1754","article-title":"The approximability of assortment optimization under ranking preferences","volume":"66","author":"Aouad","year":"2018","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0003","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/S0377-2217(01)00340-X","article-title":"The maximum capture problem with random utilities: problem formulation and algorithms","volume":"143","author":"Benati","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0004","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s00453-019-00610-8","article-title":"Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments","volume":"82","author":"Berbeglia","year":"2020","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0005","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1287\/opre.2016.1505","article-title":"A markov chain approximation to choice modeling","volume":"64","author":"Blanchet","year":"2016","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0006","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0191-2607(80)90055-2","article-title":"The effect of fuel economy standards on the u.s. automotive market: An hedonic demand analysis","volume":"14","author":"Boyd","year":"1980","journal-title":"Transportation Research Part A: General"},{"key":"10.1016\/j.ejor.2025.11.004_bib0007","series-title":"Convex optimization","author":"Boyd","year":"2004"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0008","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/opre.1080.0567","article-title":"A column generation algorithm for choice-based network revenue management","volume":"57","author":"Bront","year":"2009","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0009","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/msom.1050.0088","article-title":"Retail assortment planning in the presence of consumer search","volume":"7","author":"Cachon","year":"2005","journal-title":"Manufacturing & Service Operations Management"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.004_bib0010","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/080733991","article-title":"Maximizing a monotone submodular function subject to a matroid constraint","volume":"40","author":"Calinescu","year":"2011","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0011","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0191-2607(80)90060-6","article-title":"Measuring the societal impacts of automobile downsizing","volume":"14","author":"Cardell","year":"1980","journal-title":"Transportation Research Part A: General"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0012","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.orl.2018.11.006","article-title":"Capacitated assortment and price optimization under the multilevel nested logit model","volume":"47","author":"Chen","year":"2019","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0013","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/msom.3.3.191.9891","article-title":"A modeling framework for category assortment planning","volume":"3","author":"Chong","year":"2001","journal-title":"Manufacturing & Service Operations Management"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0014","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1287\/opre.2017.1703","article-title":"Technical note\u2013a conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model","volume":"66","author":"\u015een","year":"2018","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0015","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.ejor.2021.09.006","article-title":"Submodularity and local search approaches for maximum capture problems under generalized extreme value models","volume":"300","author":"Dam","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0016","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1016\/j.ejor.2023.04.024","article-title":"Robust maximum capture facility location under random utility maximization models","volume":"310","author":"Dam","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.004_bib0017","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.2014.1256","article-title":"Assortment optimization under variants of the nested logit model","volume":"62","author":"Davis","year":"2014","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.004_bib0018","article-title":"Near-optimal algorithms for capacity constrained assortment optimization","author":"D\u00e9sir","year":"2014","journal-title":"Available at SSRN 2543309"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.004_bib0019","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/mnsc.2018.3230","article-title":"Constrained assortment optimization under the markov chain\u2013based choice model","volume":"66","author":"D\u00e9sir","year":"2020","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.004_bib0020","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1287\/opre.2021.2142","article-title":"Technical note\u2013capacitated assortment optimization: hardness and approximation","volume":"70","author":"D\u00e9sir","year":"2022","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.004_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106336","article-title":"Joint location and cost planning in maximum capture facility location under random utilities","volume":"159","author":"Duong","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.004_bib0022","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","article-title":"An outer-approximation algorithm for a class of mixed-integer nonlinear programs","volume":"36","author":"Duran","year":"1986","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0023","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"Journal of the ACM (JACM)"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.004_bib0024","doi-asserted-by":"crossref","first-page":"1598","DOI":"10.1111\/poms.12365","article-title":"Bounding optimal expected revenues for assortment optimization under mixtures of multinomial logits","volume":"24","author":"Feldman","year":"2015","journal-title":"Production and Operations Management"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0025","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.trb.2008.10.004","article-title":"Discrete choice models with multiplicative error terms","volume":"43","author":"Fosgerau","year":"2009","journal-title":"Transportation Research Part B"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.004_bib0026","doi-asserted-by":"crossref","first-page":"2583","DOI":"10.1287\/mnsc.2014.1931","article-title":"Constrained assortment optimization for the nested logit model","volume":"60","author":"Gallego","year":"2014","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0027","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10898-022-01131-5","article-title":"Fractional 0\u20131 programming and submodularity","volume":"84","author":"Han","year":"2022","journal-title":"Journal of Global Optimization"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.004_bib0028","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1287\/opre.1070.0409","article-title":"Demand estimation and assortment optimization under substitution: Methodology and application","volume":"55","author":"K\u00f6k","year":"2007","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.004_bib0029","first-page":"99","article-title":"Assortment planning: Review of literature and industry practice","author":"K\u00f6k","year":"2009"},{"key":"10.1016\/j.ejor.2025.11.004_bib0030","series-title":"Soda\u201909: Proceedings of the 20th annual acm-siam symposium on discrete algorithms","first-page":"545","article-title":"Maximizing submodular set functions subject to multiple linear constraints","author":"Kulik","year":"2009"},{"issue":"10","key":"10.1016\/j.ejor.2025.11.004_bib0031","doi-asserted-by":"crossref","first-page":"2073","DOI":"10.1177\/10591478241263857","article-title":"Constrained assortment optimization under the cross-nested logit model","volume":"33","author":"Le","year":"2024","journal-title":"Production and Operations Management"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.004_bib0032","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/opre.2015.1355","article-title":"The d-level nested logit model: Assortment and price optimization problems","volume":"63","author":"Li","year":"2015","journal-title":"Operations research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0033","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1287\/ijoc.2019.0910","article-title":"Assortment optimization under the multinomial logit model with sequential offerings","volume":"32","author":"Liu","year":"2020","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0034","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2017.09.023","article-title":"Outer approximation and submodular cuts for maximum capture facility location problems with random utilities","volume":"266","author":"Ljubi\u0107","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.004_bib0035","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.orl.2019.09.009","article-title":"Assortment optimization under the multinomial logit model with product synergies","volume":"47","author":"Lo","year":"2019","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0036","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/opre.49.3.334.11210","article-title":"Stocking retail assortments under dynamic consumer substitution","volume":"49","author":"Mahajan","year":"2001","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0037","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1016\/j.ejor.2020.01.020","article-title":"A multicut outer-approximation approach for competitive facility location under random utilities","volume":"284","author":"Mai","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.004_bib0038","series-title":"Structural analysis of discrete data with econometric applications","first-page":"198","article-title":"Econometric models of probabilistic choice","author":"McFadden","year":"1981"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0039","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/1099-1255(200009\/10)15:5<447::AID-JAE570>3.0.CO;2-1","article-title":"Mixed MNL models for discrete response","volume":"15","author":"McFadden","year":"2000","journal-title":"Journal of Applied Econometrics"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.004_bib0040","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10898-019-00817-7","article-title":"Fractional 0\u20131 programs: Links between mixed-integer linear and conic quadratic formulations","volume":"75","author":"Mehmanchi","year":"2019","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.ejor.2025.11.004_bib0041","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.dam.2012.03.003","article-title":"A branch-and-cut algorithm for the latent-class logit assortment problem","volume":"164","author":"M\u00e9ndez-D\u00edaz","year":"2014","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.11.004_bib0042","series-title":"North-holland mathematics studies","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0304-0208(08)73471-6","article-title":"Maximizing submodular set functions: Formulations and analysis of algorithms","volume":"vol. 59","author":"Nemhauser","year":"1981"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0043","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2013i","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Mathematical Programming"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.004_bib0044","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1287\/opre.1100.0866","article-title":"Dynamic assortment optimization with a multinomial logit choice model and capacity constraint","volume":"58","author":"Rusmevichientong","year":"2010","journal-title":"Operations Research"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.004_bib0045","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1111\/poms.12191","article-title":"Assortment optimization under the multinomial logit model with random choice parameters","volume":"23","author":"Rusmevichientong","year":"2014","journal-title":"Production and Operations Management"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.004_bib0046","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.1120.1063","article-title":"Robust assortment optimization in revenue management under the multinomial logit choice model","volume":"60","author":"Rusmevichientong","year":"2012","journal-title":"Operations Research"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.004_bib0047","doi-asserted-by":"crossref","first-page":"1496","DOI":"10.1287\/mnsc.45.11.1496","article-title":"On the relationship between inventory costs and variety benefits in retail assortments","volume":"45","author":"Ryzin","year":"1999","journal-title":"Management Science"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0048","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1287\/mnsc.2020.3657","article-title":"Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints","volume":"67","author":"Sumida","year":"2021","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0049","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","article-title":"A note on maximizing a submodular set function subject to a knapsack constraint","volume":"32","author":"Sviridenko","year":"2004","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.004_bib0050","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/mnsc.1030.0147","article-title":"Revenue management under a general discrete choice model of consumer behavior","volume":"50","author":"Talluri","year":"2004","journal-title":"Management Science"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.004_bib0051","doi-asserted-by":"crossref","DOI":"10.1111\/j.1937-5956.2012.01423.x","article-title":"Joint stocking and product offer decisions under the multinomial logit model","volume":"22","author":"Topaloglu","year":"2013","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2025.11.004_bib0052","series-title":"Discrete Choice Methods with Simulation","author":"Train","year":"2003"},{"key":"10.1016\/j.ejor.2025.11.004_bib0053","series-title":"Proceedings of the 40th international conference on machine learning","first-page":"34584","article-title":"Submodular order functions and assortment optimization","volume":"vol. 202","author":"Udwani","year":"2023"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.004_bib0054","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/opre.1050.0194","article-title":"Revenue management for parallel flights with customer-choice behavior","volume":"53","author":"Zhang","year":"2005","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008975?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008975?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:28:52Z","timestamp":1773293332000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725008975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725008975"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.004","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constrained assortment optimization under the mixed-Logit model: Approximation schemes and outer approximation approaches","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}