{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T17:39:26Z","timestamp":1773164366527,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T00:00:00Z","timestamp":1660089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T00:00:00Z","timestamp":1660089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Nos. 72071202, 71671184 and 71971108"],"award-info":[{"award-number":["Nos. 72071202, 71671184 and 71971108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Top Six Talents\u2019 Project of Jiangsu Province","award":["XNYQC-001"],"award-info":[{"award-number":["XNYQC-001"]}]},{"name":"Graduate Innovation Program of China University of Mining and Technology","award":["2022WLKXJ021"],"award-info":[{"award-number":["2022WLKXJ021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11590-022-01916-3","type":"journal-article","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T16:02:55Z","timestamp":1660147375000},"page":"453-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance"],"prefix":"10.1007","volume":"17","author":[{"given":"Yi","family":"Lei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7816-0707","authenticated-orcid":false,"given":"Hu","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Pengjie","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,10]]},"reference":[{"key":"1916_CR1","volume-title":"Network Flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"6794","key":"1916_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barabasi, A.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"issue":"2","key":"1916_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Rudolf, G., Zhao, J.: On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput. Syst. 43(2), 204\u2013233 (2008)","journal-title":"Theory Comput. Syst."},{"key":"1916_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"HW Corley","year":"1982","unstructured":"Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Oper. Res. Lett. 1, 157\u2013161 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1916_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(00)00175-7","volume":"79","author":"E Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmyer, P.: A faster computation of the most vital edge of a shortest path between two nodes. Inf. Process. Lett. 79(2), 81\u201385 (2001)","journal-title":"Inf. Process. Lett."},{"key":"1916_CR6","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 539\u2013546 (1996)"},{"issue":"11","key":"1916_CR7","doi-asserted-by":"publisher","first-page":"2888","DOI":"10.1016\/j.cor.2012.02.023","volume":"39","author":"C Bazgan","year":"2012","unstructured":"Bazgan, C., Toubaline, S., Vanderpooten, D.: Efficient determination of the k most vital edges for the minimum spanning tree problem. Comput. Oper. Res. 39(11), 2888\u20132898 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"1916_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(93)90082-K","volume":"48","author":"K Iwano","year":"1993","unstructured":"Iwano, K., Katoh, N.: Efficient algorithms for finding the most vital edge of a minimum spanning tree. Inf. Process. Lett. 48(5), 211\u2013213 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"13","key":"1916_CR9","doi-asserted-by":"publisher","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R Zenklusen","year":"2009","unstructured":"Zenklusen, R., Ries, B., Picouleau, C., Werra, D., Bentz, C., de Costa, M.: Blockers and transversals. Dis. Math. 309(13), 4306\u20134314 (2009)","journal-title":"Dis. Math."},{"issue":"15","key":"1916_CR10","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Matching interdiction. Dis. Appl. Math. 158(15), 1676\u20131690 (2010)","journal-title":"Dis. Appl. Math."},{"key":"1916_CR11","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.orl.2013.10.001","volume":"41","author":"C Bazgan","year":"2013","unstructured":"Bazgan, C., Toubaline, S., Vanderpooten, D.: Critical edges for the assignment problem: complexity and exact resolution. Oper. Res. Lett. 41, 685\u2013689 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1916_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2009.08.009","volume":"310","author":"B Ries","year":"2010","unstructured":"Ries, B., Bentz, C., Picouleau, C., Werra, D., Zenklusen, R., de Costa, M.: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. Dis. Math. 310(1), 132\u2013146 (2010)","journal-title":"Dis. Math."},{"issue":"13","key":"1916_CR13","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1016\/j.dam.2010.04.008","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Network flow interdiction on planar graphs. Dis. Appl. Math. 158(13), 1441\u20131455 (2010)","journal-title":"Dis. Appl. Math."},{"key":"1916_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.orl.2009.09.013","volume":"38","author":"DS Altner","year":"2010","unstructured":"Altner, D.S., Ergun, Z., Uhan, N.A.: The maximum flow network interdiction problem: valid inequal ities, integrality gaps and approximability. Oper. Res. Lett. 38, 33\u201338 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1916_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10878-012-9469-8","volume":"25","author":"C Bazgan","year":"2013","unstructured":"Bazgan, C., Toubaline, S., Vanderpooten, D.: Complexity of determining the most vital elements for the p-median and p-center location problems. J. Combin. Optim. 25(2), 191\u2013207 (2013)","journal-title":"J. Combin. Optim."},{"key":"1916_CR16","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1007\/s11590-020-01687-9","volume":"15","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Guan, X., Wang, H., Pardalos, P.M.: Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance. Optim. Lett. 15, 2661\u20132680 (2021)","journal-title":"Optim. Lett."},{"issue":"1","key":"1916_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/opre.27.1.161","volume":"27","author":"EV Denardo","year":"1979","unstructured":"Denardo, E.V., Fox, B.L.: Shortest-route methods: 1. Reaching, pruning, and buckets. Oper. Res. 27(1), 161\u2013186 (1979)","journal-title":"Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01916-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01916-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01916-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T23:06:35Z","timestamp":1675983995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01916-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1916"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01916-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,10]]},"assertion":[{"value":"28 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}