{"id":"https://openalex.org/W4415196893","doi":"https://doi.org/10.1007/s12532-025-00291-1","title":"A novel Pareto-optimal cut selection strategy for Benders Decomposition","display_name":"A novel Pareto-optimal cut selection strategy for Benders Decomposition","publication_year":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415196893","doi":"https://doi.org/10.1007/s12532-025-00291-1"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-025-00291-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00291-1","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s12532-025-00291-1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086751726","display_name":"Lukas Glomb","orcid":"https://orcid.org/0000-0002-2383-4935"},"institutions":[{"id":"https://openalex.org/I3130238102","display_name":"Lutheran University of Applied Sciences Nuremberg","ror":"https://ror.org/01tbgce33","country_code":"DE","type":"education","lineage":["https://openalex.org/I3130238102"]},{"id":"https://openalex.org/I4210138840","display_name":"Academy of Fine Arts Nuremberg","ror":"https://ror.org/03yxw1t21","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210138840"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lukas Glomb","raw_affiliation_strings":["Department Liberal Arts and Social Sciences, University of Technology Nuremberg, Nuremberg, Germany"],"affiliations":[{"raw_affiliation_string":"Department Liberal Arts and Social Sciences, University of Technology Nuremberg, Nuremberg, Germany","institution_ids":["https://openalex.org/I4210138840","https://openalex.org/I3130238102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006613126","display_name":"Frauke Liers","orcid":"https://orcid.org/0000-0002-1671-0344"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frauke Liers","raw_affiliation_strings":["Department of Data Science, FAU Erlangen-Nuremberg, Nuremberg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Data Science, FAU Erlangen-Nuremberg, Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086089193","display_name":"Florian R\u00f6sel","orcid":"https://orcid.org/0000-0003-3583-9925"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian R\u00f6sel","raw_affiliation_strings":["Department of Data Science, FAU Erlangen-Nuremberg, Nuremberg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Data Science, FAU Erlangen-Nuremberg, Nuremberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086751726"],"corresponding_institution_ids":["https://openalex.org/I3130238102","https://openalex.org/I4210138840"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31024653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":"211","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9980999827384949,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6219000220298767},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.5813000202178955},{"id":"https://openalex.org/keywords/epigraph","display_name":"Epigraph","score":0.5253000259399414},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5163999795913696},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4961000084877014},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.4675000011920929},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.42989999055862427},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4271000027656555},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3995000123977661}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7286999821662903},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6219000220298767},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.5813000202178955},{"id":"https://openalex.org/C17192189","wikidata":"https://www.wikidata.org/wiki/Q1347059","display_name":"Epigraph","level":2,"score":0.5253000259399414},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5163999795913696},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4961000084877014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49239999055862427},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3716000020503998},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.3546999990940094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3449000120162964},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.3181000053882599},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.3061000108718872},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.289000004529953},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2506999969482422},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12532-025-00291-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00291-1","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:open.fau.de:openfau/39113","is_oa":true,"landing_page_url":"https://open.fau.de/handle/openfau/39113","pdf_url":"https://open.fau.de/bitstreams/864d44ff-0de0-45f2-b371-edc0cd3e3e8b/download","source":{"id":"https://openalex.org/S7407055110","display_name":"OPUS FAU - Online publication system of Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s12532-025-00291-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-025-00291-1","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1931616235","https://openalex.org/W1967113490","https://openalex.org/W1969782132","https://openalex.org/W1976836184","https://openalex.org/W1984952615","https://openalex.org/W1985028263","https://openalex.org/W1988668636","https://openalex.org/W1992713772","https://openalex.org/W1994771844","https://openalex.org/W2027328792","https://openalex.org/W2030008061","https://openalex.org/W2042581190","https://openalex.org/W2044121814","https://openalex.org/W2047577782","https://openalex.org/W2047747388","https://openalex.org/W2051832598","https://openalex.org/W2061962896","https://openalex.org/W2072989575","https://openalex.org/W2086522200","https://openalex.org/W2091847830","https://openalex.org/W2100140125","https://openalex.org/W2115819683","https://openalex.org/W2129946839","https://openalex.org/W2145568361","https://openalex.org/W2148749466","https://openalex.org/W2149913958","https://openalex.org/W2152206346","https://openalex.org/W2156577211","https://openalex.org/W2157158960","https://openalex.org/W2160155518","https://openalex.org/W2171978813","https://openalex.org/W2226494280","https://openalex.org/W2301790113","https://openalex.org/W2345953693","https://openalex.org/W2469165122","https://openalex.org/W2548209335","https://openalex.org/W2560324934","https://openalex.org/W2742403229","https://openalex.org/W2770631757","https://openalex.org/W2794530433","https://openalex.org/W3013906842","https://openalex.org/W3016297128","https://openalex.org/W3048011742","https://openalex.org/W3085454911","https://openalex.org/W3211811167","https://openalex.org/W4250535541","https://openalex.org/W4362696557","https://openalex.org/W4382317341","https://openalex.org/W7077521215"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Decomposition":[1,21,34,129],"methods":[2,100],"can":[3,22,57],"be":[4,23,97],"used":[5,24],"to":[6,25,66,96,120,139,167,251,275],"create":[7],"efficient":[8,141],"solution":[9],"algorithms":[10],"for":[11,127,148],"a":[12,41,87,118,132,152,222,253],"wide":[13],"range":[14],"of":[15,44,53,61,86,90,104,123,135,155,172,245,248],"optimization":[16,30,46],"problems.":[17],"For":[18],"example,":[19],"Benders":[20,33,37,128],"solve":[26,252],"scenario-expanded":[27],"two-stage":[28],"stochastic":[29],"problems":[31,212],"effectively.":[32],"iteratively":[35],"generates":[36],"cuts":[38,56,149,249],"by":[39,130],"solving":[40],"simplified":[42],"version":[43,89],"an":[45,140],"problem,":[47],"the":[48,54,59,91,105,121,164,170,193,215,227,234,238,246,271],"so-called":[49],"subproblem.":[50],"The":[51,72,204],"choice":[52,69],"generated":[55,200],"impact":[58],"performance":[60],"this":[62,68,257],"approach.":[63],"Several":[64],"approaches":[65],"making":[67],"are":[70],"known.":[71],"Magnanti-Wong":[73],"method":[74,210,235,258],"focuses":[75],"on":[76,82,187],"generating":[77],"Pareto-optimal":[78],"cuts.":[79],"Cuts":[80],"based":[81],"minimal":[83,228],"infeasible":[84,229],"subsystems":[85],"modified":[88],"subproblem":[92,106,272],"have":[93,111,116,162,178],"been":[94,112],"proven":[95],"effective.":[98],"Additionally,":[99],"that":[101,150,208],"use":[102],"facets":[103],"\u2019s":[107],"value":[108],"function":[109],"epigraph":[110],"developed":[113],"recently.":[114],"We":[115,177],"made":[117],"contribution":[119],"field":[122],"cut":[124,142,174,181,231,240],"selection":[125,143,175,182,224,241],"strategies":[126,242],"introducing":[131],"novel":[133],"concept":[134],"Pareto-optimality,":[136],"which":[137],"leads":[138],"strategy.":[144,176],"This":[145],"strategy":[146,183,225],"aims":[147],"exclude":[151],"large":[153],"set":[154],"points":[156],"from":[157,192],"being":[158],"optimal.":[159],"Furthermore,":[160],"we":[161],"established":[163],"algorithmic":[165],"framework":[166],"fully":[168],"leverage":[169],"potential":[171],"our":[173,180,209],"compared":[179],"with":[184,226,264],"several":[185],"others":[186],"various":[188],"instances,":[189],"including":[190],"instances":[191],"MIPLib,":[194],"network":[195],"design":[196],"problems,":[197],"and":[198],"randomly":[199],"mixed-integer":[201],"linear":[202],"programs.":[203],"computational":[205],"results":[206],"indicate":[207],"solves":[211],"faster":[213],"than":[214],"benchmark":[216],"approaches,":[217],"particularly":[218,260],"when":[219],"combined":[220],"as":[221],"hybrid":[223],"subsystem":[230],"selection.":[232],"Moreover,":[233],"clearly":[236],"outperforms":[237],"other":[239],"in":[243,262,268],"terms":[244],"number":[247],"required":[250],"problem":[254],"optimally.":[255],"Therefore,":[256],"is":[259,273],"effective":[261],"situations":[263],"limited":[265],"memory":[266],"or":[267],"cases":[269],"where":[270],"challenging":[274],"solve.":[276]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-15T00:00:00"}