{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:52Z","timestamp":1740169192828,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["71571186"],"award-info":[{"award-number":["71571186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3012963","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T22:54:21Z","timestamp":1596149661000},"page":"146535-146547","source":"Crossref","is-referenced-by-count":2,"title":["The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3172-7072","authenticated-orcid":false,"given":"Kaiming","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1504-2137","authenticated-orcid":false,"given":"Xiangyu","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250412"},{"key":"ref38","first-page":"252","article-title":"Network flows: Theory, algorithms and applications","volume":"41","author":"ahuja","year":"1995","journal-title":"ZOR-Methods Models Oper Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0191"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2012.676749"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2017050"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2010.03.008"},{"key":"ref37","volume":"174","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GAMENETS.2014.7043716"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.04.004"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21839"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90236-R"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2011.07.041"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584329"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.10039"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-017-0185-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2008.06.008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.06.011"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.243"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.10.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996862"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.04.011"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.11.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485952"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2009.2032232"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/su12020581"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.027"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1890"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.20236"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_61"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/07408170500488956"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.6.934"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.06.024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.15388\/Informatica.2010.305"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/6436729"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.1973"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737475"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2838570"},{"journal-title":"Transportation Network Test Problems","year":"2020","author":"bar-gera","key":"ref41"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.08.013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/625"},{"key":"ref43","volume":"2","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09152986.pdf?arnumber=9152986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:54:49Z","timestamp":1639770889000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9152986\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3012963","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}