{"id":"https://openalex.org/W4385900344","doi":"https://doi.org/10.1007/s43069-023-00242-3","title":"Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders\u2019 Decomposition","display_name":"Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders\u2019 Decomposition","publication_year":2023,"publication_date":"2023-08-04","ids":{"openalex":"https://openalex.org/W4385900344","doi":"https://doi.org/10.1007/s43069-023-00242-3"},"language":"en","primary_location":{"id":"doi:10.1007/s43069-023-00242-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-023-00242-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-023-00242-3.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Operations Research Forum","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s43069-023-00242-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092654316","display_name":"Aigerim Saken","orcid":null},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Aigerim Saken","raw_affiliation_strings":["Department of Mathematics, University of Exeter, Stocker Rd, Exeter, EX4 4PY, UK"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Exeter, Stocker Rd, Exeter, EX4 4PY, UK","institution_ids":["https://openalex.org/I23923803"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038909431","display_name":"Emil Karlsson","orcid":"https://orcid.org/0000-0002-9498-1924"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I1339161553","display_name":"Saab (Switzerland)","ror":"https://ror.org/045rgx026","country_code":"CH","type":"company","lineage":["https://openalex.org/I1339161553","https://openalex.org/I4210153572"]}],"countries":["CH","SE"],"is_corresponding":false,"raw_author_name":"Emil Karlsson","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, SE-581 83, Sweden","Saab AB, Link\u00f6ping, SE-581 88, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, SE-581 83, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Saab AB, Link\u00f6ping, SE-581 88, Sweden","institution_ids":["https://openalex.org/I1339161553"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041795178","display_name":"Stephen J. Maher","orcid":"https://orcid.org/0000-0003-3773-6882"},"institutions":[{"id":"https://openalex.org/I4210097856","display_name":"Accadis Hochschule Bad Homburg","ror":"https://ror.org/015a98c38","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210097856"]},{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["DE","GB"],"is_corresponding":false,"raw_author_name":"Stephen J. Maher","raw_affiliation_strings":["Department of Mathematics, University of Exeter, Stocker Rd, Exeter, EX4 4PY, UK","Quantagonia GmbH, Bad Homburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Exeter, Stocker Rd, Exeter, EX4 4PY, UK","institution_ids":["https://openalex.org/I23923803"]},{"raw_affiliation_string":"Quantagonia GmbH, Bad Homburg, Germany","institution_ids":["https://openalex.org/I4210097856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053900371","display_name":"Elina R\u00f6nnberg","orcid":"https://orcid.org/0000-0002-2081-2888"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Elina R\u00f6nnberg","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, SE-581 83, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, SE-581 83, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5092654316"],"corresponding_institution_ids":["https://openalex.org/I23923803"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2780},"fwci":0.6008,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71621936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"4","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9639999866485596,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6176407933235168},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5778313279151917},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5627113580703735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5336416959762573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5252318382263184},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4758177399635315},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46298471093177795},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4479040801525116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42398688197135925},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.41531702876091003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31608328223228455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25939929485321045},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12013325095176697},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06721457839012146}],"concepts":[{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6176407933235168},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5778313279151917},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5627113580703735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5336416959762573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5252318382263184},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4758177399635315},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46298471093177795},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4479040801525116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42398688197135925},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.41531702876091003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31608328223228455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25939929485321045},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12013325095176697},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06721457839012146},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s43069-023-00242-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-023-00242-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-023-00242-3.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Operations Research Forum","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:liu-196467","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-196467","pdf_url":"https://liu.diva-portal.org/smash/get/diva2:1786084/FULLTEXT02","source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:RePEc:spr:snopef:v:4:y:2023:i:3:d:10.1007_s43069-023-00242-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s43069-023-00242-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s43069-023-00242-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s43069-023-00242-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s43069-023-00242-3.pdf","source":{"id":"https://openalex.org/S4210215153","display_name":"Operations Research Forum","issn_l":"2662-2556","issn":["2662-2556"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"Operations Research Forum","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322225","display_name":"Link\u00f6pings Universitet","ror":"https://ror.org/05ynxx418"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4385900344.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W42214504","https://openalex.org/W1483563708","https://openalex.org/W1502746131","https://openalex.org/W1508945008","https://openalex.org/W1551931587","https://openalex.org/W1981066696","https://openalex.org/W2028826326","https://openalex.org/W2038323738","https://openalex.org/W2085637568","https://openalex.org/W2089846192","https://openalex.org/W2160089068","https://openalex.org/W2169427658","https://openalex.org/W2332094630","https://openalex.org/W2560324934","https://openalex.org/W2564265628","https://openalex.org/W2793040688","https://openalex.org/W2971583140","https://openalex.org/W3085049663","https://openalex.org/W3171972036","https://openalex.org/W4283518553"],"related_works":["https://openalex.org/W2120447654","https://openalex.org/W2977179488","https://openalex.org/W2144453115","https://openalex.org/W2128223750","https://openalex.org/W4238532390","https://openalex.org/W2188872161","https://openalex.org/W2002978035","https://openalex.org/W2961779879","https://openalex.org/W797688974","https://openalex.org/W2209382646"],"abstract_inverted_index":{"Abstract":[0],"Cut-strengthening":[1],"techniques":[2,24,32,60,90,109],"have":[3,20],"a":[4,132],"significant":[5],"impact":[6],"on":[7],"the":[8,12,34,39,80,115,119,136,147],"computational":[9,36,85,100],"effectiveness":[10],"of":[11,48,58,82,87,121,135],"logic-based":[13],"Benders\u2019":[14],"decomposition":[15],"(LBBD)":[16],"scheme.":[17,41],"While":[18],"there":[19],"been":[21,68],"numerous":[22],"cut-strengthening":[23,59,89,108,150],"proposed,":[25],"very":[26],"little":[27],"is":[28,43,126,131],"understood":[29],"about":[30],"which":[31],"achieve":[33],"best":[35],"performance":[37],"for":[38,61,76],"LBBD":[40,49,137],"This":[42,70],"typically":[44],"due":[45],"to":[46,73,94],"implementations":[47],"being":[50],"problem":[51,97,104],"specific,":[52],"and":[53,64,118,139,143],"thus,":[54],"no":[55,122],"systematic":[56],"study":[57,86,101],"both":[62],"feasibility":[63],"optimality":[65],"cuts":[66,113],"has":[67],"performed.":[69],"paper":[71],"aims":[72],"provide":[74],"guidance":[75],"future":[77],"researchers":[78],"with":[79],"presentation":[81],"an":[83],"extensive":[84],"five":[88],"that":[91,107,110,128],"are":[92,146],"applied":[93],"three":[95],"different":[96],"types.":[98],"The":[99],"involving":[102],"3000":[103],"instances":[105],"shows":[106],"generate":[111],"irreducible":[112],"outperform":[114],"greedy":[116],"algorithm":[117],"use":[120],"cut":[123,129],"strengthening.":[124],"It":[125],"shown":[127],"strengthening":[130],"necessary":[133],"part":[134],"scheme,":[138],"depth-first":[140],"binary":[141],"search":[142],"deletion":[144],"filter":[145],"most":[148],"effective":[149],"techniques.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}