{"id":"https://openalex.org/W4390188909","doi":"https://doi.org/10.1109/hpec58863.2023.10363524","title":"Decomposition Based Refinement for the Network Interdiction Problem","display_name":"Decomposition Based Refinement for the Network Interdiction Problem","publication_year":2023,"publication_date":"2023-09-25","ids":{"openalex":"https://openalex.org/W4390188909","doi":"https://doi.org/10.1109/hpec58863.2023.10363524"},"language":"en","primary_location":{"id":"doi:10.1109/hpec58863.2023.10363524","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5029524511","display_name":"Krish Matta","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Krish Matta","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University,Pittsburgh,USA","School of Computer Science, Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University,Pittsburgh,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100605609","display_name":"Xiaoyuan Liu","orcid":"https://orcid.org/0000-0003-1084-9713"},"institutions":[{"id":"https://openalex.org/I4210094759","display_name":"Fujitsu (United States)","ror":"https://ror.org/0073whr05","country_code":"US","type":"company","lineage":["https://openalex.org/I2252096349","https://openalex.org/I4210094759"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoyuan Liu","raw_affiliation_strings":["Fujitsu Research of America,Sunnyvale,USA","Fujitsu Research of America, Sunnyvale, USA"],"affiliations":[{"raw_affiliation_string":"Fujitsu Research of America,Sunnyvale,USA","institution_ids":["https://openalex.org/I4210094759"]},{"raw_affiliation_string":"Fujitsu Research of America, Sunnyvale, USA","institution_ids":["https://openalex.org/I4210094759"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057164472","display_name":"Ilya Safro","orcid":"https://orcid.org/0000-0001-6284-7408"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Safro","raw_affiliation_strings":["University of Delaware,Department of Computer and Information Sciences,Newark,USA","Department of Computer and Information Sciences, University of Delaware, Newark, USA"],"affiliations":[{"raw_affiliation_string":"University of Delaware,Department of Computer and Information Sciences,Newark,USA","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Delaware, Newark, USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029524511"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.1544,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4865465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.998199999332428,"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.998199999332428,"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.9801999926567078,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9787999987602234,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.9605118632316589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7770671844482422},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6081134676933289},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4740928113460541},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4488530158996582},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44851142168045044},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4434770941734314},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4331516623497009},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43136030435562134},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4178425073623657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.410855770111084},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33858567476272583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32852187752723694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1419074833393097},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1196226179599762},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11291390657424927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.08519613742828369}],"concepts":[{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.9605118632316589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7770671844482422},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6081134676933289},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4740928113460541},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4488530158996582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44851142168045044},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4434770941734314},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4331516623497009},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43136030435562134},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4178425073623657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.410855770111084},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33858567476272583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32852187752723694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1419074833393097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1196226179599762},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11291390657424927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.08519613742828369},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec58863.2023.10363524","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/hpec58863.2023.10363524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1546413495","https://openalex.org/W1982447484","https://openalex.org/W1990326494","https://openalex.org/W1999293689","https://openalex.org/W2008423363","https://openalex.org/W2012328405","https://openalex.org/W2020378392","https://openalex.org/W2048643036","https://openalex.org/W2093517413","https://openalex.org/W2094463866","https://openalex.org/W2098716819","https://openalex.org/W2121496599","https://openalex.org/W2132022337","https://openalex.org/W2404932809","https://openalex.org/W2489773810","https://openalex.org/W2765457063","https://openalex.org/W2898784085","https://openalex.org/W2951543070","https://openalex.org/W2963000054","https://openalex.org/W2963757591","https://openalex.org/W2981590007","https://openalex.org/W2990475267","https://openalex.org/W3101339117","https://openalex.org/W3101642221","https://openalex.org/W3104001151","https://openalex.org/W3104869795","https://openalex.org/W3110558526","https://openalex.org/W3126076156","https://openalex.org/W4200038602","https://openalex.org/W4225417080","https://openalex.org/W4231846589","https://openalex.org/W4245095675","https://openalex.org/W4251279277"],"related_works":["https://openalex.org/W4327856853","https://openalex.org/W3016678934","https://openalex.org/W2462784503","https://openalex.org/W4248338598","https://openalex.org/W4390917124","https://openalex.org/W2997061389","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"The":[0],"shortest":[1],"path":[2],"network":[3],"interdiction":[4],"(SPNI)":[5],"problem":[6,51,85],"poses":[7],"significant":[8],"computational":[9,89],"challenges":[10],"due":[11],"to":[12,59,72,82,99],"its":[13],"NP-hardness.":[14],"Current":[15],"solutions,":[16],"primarily":[17],"based":[18],"on":[19],"integer":[20],"programming":[21],"methods,":[22],"are":[23,56,69,115],"inefficient":[24],"for":[25,91,102],"large-scale":[26,92],"instances.":[27,93],"In":[28],"this":[29],"paper,":[30],"we":[31],"introduce":[32],"a":[33,74],"novel":[34],"hybrid":[35],"algorithm":[36],"that":[37],"can":[38],"utilize":[39],"Ising":[40],"Processing":[41],"Units":[42],"(IPUs)":[43],"alongside":[44],"classical":[45,64],"solvers.":[46],"This":[47],"approach":[48,96],"decomposes":[49],"the":[50,60],"into":[52],"manageable":[53],"sub-problems,":[54],"which":[55],"then":[57],"offloaded":[58],"slow":[61],"but":[62],"high-quality":[63],"solvers":[65,86],"or":[66],"IPU.":[67],"Results":[68],"subsequently":[70],"recombined":[71],"form":[73],"global":[75],"solution.":[76],"Our":[77,109],"method":[78],"demonstrates":[79],"comparable":[80],"quality":[81],"existing":[83],"whole":[84],"while":[87],"reducing":[88],"time":[90],"Furthermore,":[94],"our":[95],"is":[97],"amenable":[98],"parallelization,":[100],"allowing":[101],"simultaneous":[103],"processing":[104],"of":[105],"decomposed":[106],"sub-problems.":[107],"Reproducibility:":[108],"source":[110],"code":[111],"and":[112],"experimental":[113],"results":[114],"available":[116],"at":[117],"https://github.com/krishxmatta/network-interdiction.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}