{"id":"https://openalex.org/W7140199560","doi":"https://doi.org/10.1016/j.cor.2026.107480","title":"Enumerative algorithms for choice-based pricing under capacity constraints","display_name":"Enumerative algorithms for choice-based pricing under capacity constraints","publication_year":2026,"publication_date":"2026-03-24","ids":{"openalex":"https://openalex.org/W7140199560","doi":"https://doi.org/10.1016/j.cor.2026.107480"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107480","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107480","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2026.107480","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tom Haering","orcid":"https://orcid.org/0000-0002-3885-8876"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Tom Haering","raw_affiliation_strings":["School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-3885-8876","affiliations":[{"raw_affiliation_string":"School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Robin Legault","orcid":"https://orcid.org/0009-0005-6551-0591"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robin Legault","raw_affiliation_strings":["Operations Research Center, Massachusetts Institute of Technology (MIT), Massachusetts Avenue, Cambridge, 02139, MA, USA"],"raw_orcid":"https://orcid.org/0009-0005-6551-0591","affiliations":[{"raw_affiliation_string":"Operations Research Center, Massachusetts Institute of Technology (MIT), Massachusetts Avenue, Cambridge, 02139, MA, USA","institution_ids":["https://openalex.org/I63966007","https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Fabian Torres","orcid":"https://orcid.org/0000-0002-7428-4515"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabian Torres","raw_affiliation_strings":["School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-7428-4515","affiliations":[{"raw_affiliation_string":"School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"Michel Bierlaire","orcid":"https://orcid.org/0000-0002-5275-7692"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michel Bierlaire","raw_affiliation_strings":["School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-5275-7692","affiliations":[{"raw_affiliation_string":"School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Rte Cantonale, Lausanne, 1015, Vaud, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":{"value":3210,"currency":"USD","value_usd":3210},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65236733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"192","issue":null,"first_page":"107480","last_page":"107480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.34369999170303345,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.34369999170303345,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.13300000131130219,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.10249999910593033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6065000295639038},{"id":"https://openalex.org/keywords/revenue-management","display_name":"Revenue management","score":0.5447999835014343},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5385000109672546},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4722999930381775},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4250999987125397},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41600000858306885},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.40630000829696655},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.39640000462532043},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.38749998807907104}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6729999780654907},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6065000295639038},{"id":"https://openalex.org/C2781386248","wikidata":"https://www.wikidata.org/wiki/Q11898700","display_name":"Revenue management","level":3,"score":0.5447999835014343},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5145999789237976},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4722999930381775},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4165000021457672},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.40630000829696655},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3749000132083893},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.3725000023841858},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2026.107480","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107480","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2026.107480","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107480","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1988622494","https://openalex.org/W2000899926","https://openalex.org/W2034504820","https://openalex.org/W2065968751","https://openalex.org/W2072726536","https://openalex.org/W2076132973","https://openalex.org/W2112036188","https://openalex.org/W2113795504","https://openalex.org/W2117923605","https://openalex.org/W2164045487","https://openalex.org/W2560324934","https://openalex.org/W2560488846","https://openalex.org/W2582920180","https://openalex.org/W2759930078","https://openalex.org/W2803781351","https://openalex.org/W2999769590","https://openalex.org/W3011311334","https://openalex.org/W3091802468","https://openalex.org/W3122879329","https://openalex.org/W3132104121","https://openalex.org/W3196392069","https://openalex.org/W4214673093","https://openalex.org/W4386258643","https://openalex.org/W4400652020"],"related_works":[],"abstract_inverted_index":{"The":[0,147,198],"choice-based":[1,260,310],"pricing":[2,218,261,314],"problem":[3],"(CPP)":[4],"consists":[5],"in":[6,94,108,139,303],"optimizing":[7],"product":[8],"prices":[9],"while":[10,235],"accounting":[11],"for":[12,63,185,232,280,309],"consumer":[13],"preferences":[14],"and":[15,41,136,156,174,192,212,222,245,264,269,292,306,320],"potential":[16],"capacity":[17,43],"constraints.":[18],"Demand":[19],"is":[20,92],"typically":[21],"modeled":[22],"using":[23],"a":[24,115],"discrete":[25],"choice":[26],"model":[27],"(DCM).":[28],"We":[29],"introduce":[30],"the":[31,38,51,64,75,83,98,109,112,121,125,142,170,202,210,239,246],"Breakpoint":[32,52,255],"Heuristic":[33,256],"Algorithm":[34,54,257],"(BHA)":[35,258],"to":[36,56,80,145,208,288],"address":[37],"CPP":[39],"with":[40,60,70,163,263,296,318,323],"without":[42,265],"constraints":[44],"as":[45,47,190],"well":[46,152],"an":[48,101,164,249],"extension":[49,180],"of":[50,74,100,118,204],"Exact":[53],"(BEA)":[55],"handle":[57],"capacities,":[58],"together":[59,295],"valid":[61,214,297],"inequalities":[62],"QCQP-L":[65],"(quadratically":[66],"constrained":[67],"quadratic":[68],"program":[69],"linear":[71],"objective)":[72],"formulation":[73],"uncapacitated":[76,171],"CPP,":[77],"allowing":[78],"us":[79],"speed":[81],"up":[82],"exact":[84,187,277,290],"Branch":[85,291],"&":[86],"Benders":[87],"Decomposition":[88],"(B&BD)":[89],"approach.":[90],"Capacity":[91],"managed":[93],"all":[95,133,182,242],"algorithms":[96],"by":[97],"use":[99],"exogenous":[102],"priority":[103],"queue.":[104],"Results":[105],"show":[106],"that,":[107],"capacitated":[110],"case,":[111,172],"BEA":[113,191],"solves":[114,259],"larger":[116],"set":[117],"instances":[119,135,184,226],"within":[120],"time":[122,196,305],"limit":[123],"than":[124,229,276,322],"state-of-the-art":[126],"MILP":[127,143],"formulation,":[128],"achieving":[129],"identical":[130],"revenues":[131],"on":[132],"completed":[134],"better":[137],"solutions":[138,162,273],"cases":[140],"where":[141],"fails":[144],"converge.":[146],"proposed":[148],"BHA":[149,173,199,221,247,268,284,300,319],"heuristic":[150],"performs":[151],"across":[153],"both":[154,220],"low-":[155],"high-dimensional":[157],"instances,":[158],"consistently":[159],"producing":[160],"near-optimal":[161,272],"average":[165,250],"gap":[166,251],"below":[167,252],"0.2%.":[168],"In":[169,216],"its":[175],"iterated":[176],"local":[177],"search-based":[178],"(ILS)":[179],"solve":[181,224],"tested":[183],"which":[186],"methods":[188,230,294],"such":[189],"B&BD":[193,205],"often":[194],"exceed":[195],"limits.":[197],"also":[200],"improves":[201],"performance":[203],"when":[206],"used":[207,287],"guide":[209,289],"search":[211],"generate":[213],"inequalities.":[215,298],"mixed-logit":[217],"problems,":[219],"ILS":[223,240,270,321],"benchmark":[225],"significantly":[227],"faster":[228,275,317],"specialized":[231],"this":[233],"setting,":[234],"maintaining":[236],"solution":[237,307],"quality;":[238],"matches":[241],"known":[243],"optima,":[244],"maintains":[248],"0.03%.":[253],"\u2022":[254,267,283,299,312],"problems":[262,315],"capacity.":[266],"deliver":[271],"drastically":[274],"meth-":[278],"ods":[279],"large-scale":[281],"CPP.":[282],"can":[285],"be":[286],"Bound":[293],"outperforms":[301],"CMA-ES":[302],"computational":[304],"quality":[308],"pricing.":[311],"Mixed-logit":[313],"solved":[316],"spe-":[324],"cialized":[325],"methods.":[326]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-03-25T00:00:00"}