{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T12:07:32Z","timestamp":1776686852109,"version":"3.51.2"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:00:00Z","timestamp":1774310400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cor.2026.107480","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T07:51:03Z","timestamp":1774338663000},"page":"107480","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enumerative algorithms for choice-based pricing under capacity constraints"],"prefix":"10.1016","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3885-8876","authenticated-orcid":false,"given":"Tom","family":"Haering","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6551-0591","authenticated-orcid":false,"given":"Robin","family":"Legault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7428-4515","authenticated-orcid":false,"given":"Fabian","family":"Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5275-7692","authenticated-orcid":false,"given":"Michel","family":"Bierlaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107480_b1","series-title":"A tactical time slot management problem under mixed logit demand","author":"Abdolhamidi","year":"2024"},{"key":"10.1016\/j.cor.2026.107480_b2","first-page":"1","article-title":"A theory of evolution strategies: The cma-es","volume":"379","author":"Auger","year":"2012","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.cor.2026.107480_b3","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 J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b4","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/trsc.2021.1071","article-title":"A simulation-based heuristic to find approximate equilibria with disaggregate demand models","volume":"55","author":"Bortolomiol","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107480_b5","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.trb.2010.09.001","article-title":"Optimizing the demand captured by a railway system with a regular timetable","volume":"45","author":"Cordone","year":"2011","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.cor.2026.107480_b6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1287\/ijoc.2016.0714","article-title":"Pricing problems under the nested logit model with a quality consistency constraint","volume":"29","author":"Davis","year":"2017","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107480_b7","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.2013.1249","article-title":"Multiproduct price optimization and competition under the nested logit model with product-differentiated price sensitivities","volume":"62","author":"Gallego","year":"2014","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10589-013-9585-0","article-title":"Mixed-logit network pricing","volume":"57","author":"Gilbert","year":"2014","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2026.107480_b9","series-title":"Simulation-Based Optimization","author":"Gosavi","year":"2015"},{"key":"10.1016\/j.cor.2026.107480_b10","series-title":"Gurobi optimizer reference manual","author":"Gurobi Optimization, LLC","year":"2024"},{"key":"10.1016\/j.cor.2026.107480_b11","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.omega.2012.10.008","article-title":"Management of school locations allowing for free school choice","volume":"41","author":"Haase","year":"2013","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107480_b12","first-page":"1","article-title":"Exact algorithms for continuous pricing with advanced discrete choice demand models","author":"Haering","year":"2024","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cor.2026.107480_b13","series-title":"The CMA evolution strategy: A tutorial","author":"Hansen","year":"2016"},{"key":"10.1016\/j.cor.2026.107480_b14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","article-title":"Completely derandomized self-adaptation in evolution strategies","volume":"9","author":"Hansen","year":"2001","journal-title":"Evol. Comput."},{"key":"10.1016\/j.cor.2026.107480_b15","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/mnsc.42.7.992","article-title":"Optimizing multinomial logit profit functions","volume":"42","author":"Hanson","year":"1996","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107480_b16","first-page":"41","article-title":"Modelling parking choices considering user heterogeneity","volume":"70","author":"Ibeas","year":"2014","journal-title":"Transp. Res. Part A: Policy Pr."},{"key":"10.1016\/j.cor.2026.107480_b17","series-title":"Essays on advanced discrete choice applications","author":"Korfmann","year":"2018"},{"key":"10.1016\/j.cor.2026.107480_b18","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1287\/ijoc.2023.0280","article-title":"A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity","volume":"37","author":"Legault","year":"2025","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107480_b19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/msom.2017.0675","article-title":"Product-line pricing under discrete mixed multinomial logit demand","volume":"21","author":"Li","year":"2019","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"10.1016\/j.cor.2026.107480_b20","first-page":"1","article-title":"Introduction to global optimization","volume":"1","author":"Liberti","year":"2008","journal-title":"\u00c9c. Polytech."},{"key":"10.1016\/j.cor.2026.107480_b21","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 J. Comput."},{"key":"10.1016\/j.cor.2026.107480_b22","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 J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b23","article-title":"Cma-es with restarts for solving cec 2013 benchmark problems","author":"Loshchilov","year":"2019","journal-title":"IEEE Congr. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107480_b24","series-title":"Handbook of Metaheuristics","first-page":"129","article-title":"Iterated local search: Framework and applications","author":"Louren\u00e7o","year":"2018"},{"key":"10.1016\/j.cor.2026.107480_b25","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 J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2023.100073","article-title":"An exact algorithm for the static pricing problem under discrete mixed logit demand","volume":"11","author":"Marandi","year":"2023","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.cor.2026.107480_b27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: Part i\u2014convex underestimating problems","volume":"10","author":"McCormick","year":"1976","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107480_b28","series-title":"Dynamic pricing under nested logit demand","author":"M\u00fcller","year":"2021"},{"key":"10.1016\/j.cor.2026.107480_b29","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.trb.2021.02.003","article-title":"Integrating advanced discrete choice models in mixed integer linear optimization","volume":"146","author":"Paneque","year":"2021","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.cor.2026.107480_b30","article-title":"A lagrangian decomposition scheme for choice-based optimization","volume":"148","author":"Paneque","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b31","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The Benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.trb.2018.03.002","article-title":"Train timetable design under elastic passenger demand","volume":"111","author":"Robenek","year":"2018","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.cor.2026.107480_b33","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":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107480_b34","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1111\/j.1937-5956.2007.tb00291.x","article-title":"Customer behavior modeling in revenue management and auctions: A review and new research opportunities","volume":"16","author":"Shen","year":"2007","journal-title":"Prod. Oper. Manage."},{"key":"10.1016\/j.cor.2026.107480_b35","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":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107480_b36","doi-asserted-by":"crossref","first-page":"7480","DOI":"10.1287\/mnsc.2021.4272","article-title":"Price optimization under the finite-mixture logit model","volume":"68","author":"van de Geer","year":"2022","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107480_b37","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.trb.2012.05.004","article-title":"Design of more equitable congestion pricing and tradable credit schemes for multimodal transportation networks","volume":"46","author":"Wu","year":"2012","journal-title":"Transp. Res. Part B: Methodol."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000985?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000985?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:23:38Z","timestamp":1776684218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":37,"alternative-id":["S0305054826000985"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107480","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumerative algorithms for choice-based pricing under capacity constraints","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107480","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107480"}}