{"id":"https://openalex.org/W3046787300","doi":"https://doi.org/10.1109/access.2020.3012963","title":"The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property","display_name":"The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3046787300","doi":"https://doi.org/10.1109/access.2020.3012963","mag":"3046787300"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3012963","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3012963","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09152986.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09152986.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043646630","display_name":"Kaiming Xiao","orcid":"https://orcid.org/0000-0002-3172-7072"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kaiming Xiao","raw_affiliation_strings":["Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0002-3172-7072","affiliations":[{"raw_affiliation_string":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114911200","display_name":"Cheng Zhu","orcid":"https://orcid.org/0000-0003-1309-5777"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng Zhu","raw_affiliation_strings":["Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100340721","display_name":"Weiming Zhang","orcid":"https://orcid.org/0000-0002-1440-4757"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weiming Zhang","raw_affiliation_strings":["Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062694794","display_name":"Xiangyu Wei","orcid":"https://orcid.org/0000-0002-1504-2137"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiangyu Wei","raw_affiliation_strings":["Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0002-1504-2137","affiliations":[{"raw_affiliation_string":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.4301,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61570059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"8","issue":null,"first_page":"146535","last_page":"146547"},"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.9955000281333923,"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.995199978351593,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.702825129032135},{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.637141227722168},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5995838046073914},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5683999061584473},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5066640973091125},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4558287262916565},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4513002932071686},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4237763285636902},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3639172911643982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3379422724246979},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2607477903366089},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2546318769454956},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1497805416584015}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.702825129032135},{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.637141227722168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5995838046073914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5683999061584473},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5066640973091125},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4558287262916565},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4513002932071686},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4237763285636902},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3639172911643982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3379422724246979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2607477903366089},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2546318769454956},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1497805416584015},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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":2,"locations":[{"id":"doi:10.1109/access.2020.3012963","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3012963","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09152986.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7423cd95a1044d0c861858ca4b78d1fb","is_oa":true,"landing_page_url":"https://doaj.org/article/7423cd95a1044d0c861858ca4b78d1fb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 146535-146547 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3012963","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3012963","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09152986.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G2985884925","display_name":"\u52a8\u6001\u591a\u91cd\u7f51\u7edc\u963b\u65ad\u95ee\u9898\u7814\u7a76","funder_award_id":"71571186","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3046787300.pdf","grobid_xml":"https://content.openalex.org/works/W3046787300.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W1885067247","https://openalex.org/W1966531911","https://openalex.org/W1977545325","https://openalex.org/W1982447484","https://openalex.org/W2000050888","https://openalex.org/W2004087121","https://openalex.org/W2007074544","https://openalex.org/W2012328405","https://openalex.org/W2026383541","https://openalex.org/W2039397642","https://openalex.org/W2040224665","https://openalex.org/W2043820931","https://openalex.org/W2044790907","https://openalex.org/W2045640143","https://openalex.org/W2061495609","https://openalex.org/W2093517413","https://openalex.org/W2094463866","https://openalex.org/W2095414146","https://openalex.org/W2107928259","https://openalex.org/W2110438635","https://openalex.org/W2116135393","https://openalex.org/W2133494553","https://openalex.org/W2138336119","https://openalex.org/W2229536649","https://openalex.org/W2536620281","https://openalex.org/W2547364131","https://openalex.org/W2588441571","https://openalex.org/W2592577925","https://openalex.org/W2625501855","https://openalex.org/W2739917298","https://openalex.org/W2792119783","https://openalex.org/W2800556351","https://openalex.org/W2803195564","https://openalex.org/W2932267653","https://openalex.org/W2951543070","https://openalex.org/W2963400974","https://openalex.org/W3000311347","https://openalex.org/W3008853713","https://openalex.org/W3036465990","https://openalex.org/W3145128584","https://openalex.org/W4205854255","https://openalex.org/W4248338598","https://openalex.org/W4372046852","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W4327856853","https://openalex.org/W3016678934","https://openalex.org/W2462784503","https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W4248338598","https://openalex.org/W2360981904"],"abstract_inverted_index":{"Critical":[0],"network":[1,9,38,57,146,150],"defense":[2],"and":[3,72,106,112,125,131,147],"attack":[4],"problems,":[5],"usually":[6],"modeled":[7],"as":[8],"interdiction,":[10,43],"is":[11,16,59,82],"of":[12,17,28,53,68,74,92,109,135,158,176],"great":[13,18],"significance.":[14],"It":[15],"interest":[19],"from":[20],"the":[21,46,56,86,122,126,129,132,156,167,173],"interdictor\u2019s":[22],"view":[23],"to":[24,49,63,84,101,117,154],"study":[25],"saturation":[26,136],"property":[27],"resource":[29,123],"allocations.":[30],"This":[31],"paper":[32],"presents":[33],"a":[34,51,90,119],"bi-objective":[35,178],"shortest":[36,69],"path":[37,70],"interdiction":[39,127],"model":[40],"with":[41,61],"node":[42],"in":[44,55,140,160],"which":[45],"interdictor":[47],"seeks":[48],"interdict":[50],"set":[52],"nodes":[54],"that":[58,166],"Pareto-optimal":[60],"respect":[62],"two":[64],"objectives,":[65],"i.e.,":[66],"maximization":[67],"length":[71],"minimization":[73],"resources":[75],"cost.":[76],"A":[77],"novel":[78],"subgraph":[79,96,168],"sequence":[80,91,169],"algorithm":[81,170],"developed":[83],"identify":[85],"efficient":[87],"frontier":[88],"through":[89],"single-objective":[93,103],"problems.":[94,104],"Novel":[95],"decomposition":[97],"algorithms":[98,113,159],"are":[99,114,138,152],"proposed":[100],"solve":[102],"Features":[105],"time":[107],"complexity":[108],"those":[110],"problems":[111],"analyzed.":[115],"Moreover,":[116],"make":[118],"trade-off":[120],"between":[121],"investment":[124],"performance,":[128],"definition":[130],"computing":[133],"method":[134],"point":[137],"introduced":[139],"this":[141,177],"paper.":[142],"Both":[143],"simulated":[144],"grid":[145],"real-world":[148],"transportation":[149],"data":[151],"used":[153],"evaluate":[155],"performance":[157],"numerical":[161],"experiments.":[162],"The":[163],"results":[164],"show":[165],"can":[171],"achieve":[172],"optimal":[174],"Pareto-frontier":[175],"problem":[179],"effectively.":[180]},"counts_by_year":[{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}