{"id":"https://openalex.org/W4387914294","doi":"https://doi.org/10.1109/codit58514.2023.10284073","title":"A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem","display_name":"A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914294","doi":"https://doi.org/10.1109/codit58514.2023.10284073"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284073","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064516722","display_name":"Isma Bentoumi","orcid":"https://orcid.org/0009-0004-8343-8813"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Isma Bentoumi","raw_affiliation_strings":["University Paris-Dauphine PSL,LAMSADE UMR CNRS 7243,Paris,France,75016"],"affiliations":[{"raw_affiliation_string":"University Paris-Dauphine PSL,LAMSADE UMR CNRS 7243,Paris,France,75016","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031762088","display_name":"Fabio Furini","orcid":"https://orcid.org/0000-0002-1839-5827"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Fabio Furini","raw_affiliation_strings":["Sapienza University of Rome,Department of Computer Control and Management Engineering “Antonio Ruberti”,Roma,Italy,00185"],"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome,Department of Computer Control and Management Engineering “Antonio Ruberti”,Roma,Italy,00185","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["University Paris-Dauphine PSL,LAMSADE UMR CNRS 7243,Paris,France,75016"],"affiliations":[{"raw_affiliation_string":"University Paris-Dauphine PSL,LAMSADE UMR CNRS 7243,Paris,France,75016","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083892488","display_name":"S\u00e9bastien Martin","orcid":"https://orcid.org/0000-0002-8528-6698"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Martin","raw_affiliation_strings":["Huawei Technologies France,Boulogne-Billancourt,France,92100"],"affiliations":[{"raw_affiliation_string":"Huawei Technologies France,Boulogne-Billancourt,France,92100","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5064516722"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.1544,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4681399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"674","last_page":"677"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10917","display_name":"Smart Grid Security and Resilience","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11502","display_name":"Facility Location and Emergency Management","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6873775720596313},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6844127178192139},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6474131941795349},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5869023203849792},{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.5831544399261475},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5537906885147095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5027725696563721},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4992063045501709},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.48574477434158325},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.47383221983909607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4567810297012329},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4202907681465149},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4101221561431885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4016389846801758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3254215121269226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16834306716918945},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11585694551467896},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10647165775299072}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6873775720596313},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6844127178192139},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6474131941795349},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5869023203849792},{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.5831544399261475},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5537906885147095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5027725696563721},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4992063045501709},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.48574477434158325},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.47383221983909607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4567810297012329},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4202907681465149},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4101221561431885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4016389846801758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3254215121269226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16834306716918945},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11585694551467896},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10647165775299072},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit58514.2023.10284073","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6499999761581421,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1513526226","https://openalex.org/W2117972428","https://openalex.org/W2133494553","https://openalex.org/W2141824346","https://openalex.org/W3156469768","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W2804458068"],"abstract_inverted_index":{"Given":[0],"a":[1,22,35,45,87],"directed":[2],"graph":[3,32],"with":[4,10,72],"capacities":[5],"and":[6,55,106],"interdiction":[7],"costs":[8],"associated":[9],"its":[11],"arcs,":[12],"the":[13,31,38,57,82,93,104,111,114],"maximum":[14],"flow":[15],"blocker":[16],"problem":[17,115],"(MFBP)":[18],"asks":[19],"to":[20,27,90,100,109,120],"find":[21],"minimum-cost":[23],"subset":[24],"of":[25,59,76,103,113],"arcs":[26],"be":[28,118],"removed":[29],"from":[30],"in":[33,52,56],"such":[34],"way":[36],"that":[37,116],"remaining":[39],"maximum-flow":[40],"value":[41],"does":[42],"not":[43],"exceed":[44],"given":[46],"threshold.":[47],"The":[48],"MFBP":[49],"has":[50],"applications":[51],"telecommunication":[53],"networks":[54],"monitoring":[58],"civil":[60],"infrastructures,":[61],"among":[62],"others.":[63],"We":[64],"propose":[65],"an":[66,73],"integer":[67],"linear":[68],"programming":[69],"formulation":[70,105],"(ILP)":[71],"exponential":[74],"number":[75],"constraints,":[77],"called":[78],"Benders":[79],"cut,":[80],"for":[81],"MFBP.":[83],"Accordingly,":[84],"we":[85],"derive":[86],"branch-and-cut":[88],"algorithm":[89],"optimally":[91],"solve":[92],"problem.":[94],"Preliminary":[95],"experimental":[96],"results":[97],"are":[98],"reported":[99],"assess":[101],"performance":[102],"more":[107],"precisely":[108],"determine":[110],"dimension":[112],"could":[117],"solved":[119],"proven":[121],"optimality.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}