{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T17:39:27Z","timestamp":1773164367746,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics","doi-asserted-by":"publisher","award":["HSE"],"award-info":[{"award-number":["HSE"]}],"id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11590-020-01687-9","type":"journal-article","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:59:01Z","timestamp":1632445141000},"page":"2661-2680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance"],"prefix":"10.1007","volume":"15","author":[{"given":"Qiao","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"1687_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, NJ (1993)"},{"issue":"6794","key":"1687_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":"1687_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":"1687_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."},{"key":"1687_CR5","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs\u00a1\u00a1 and nodes, Technical Report CS-TR-3539. University of Maryland, Department of Computer Science (1995)"},{"issue":"2","key":"1687_CR6","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":"1687_CR7","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: Proceedings of the 7th ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 1996), 539\u2013546, (1996)"},{"issue":"11","key":"1687_CR8","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."},{"key":"1687_CR9","doi-asserted-by":"crossref","unstructured":"Pettie, S.: Sensitivity analysis of minimum spanning tree in sub-inverse- Ackermann time. In: Proceedings of 16th international symposium on algorithms and computation (ISAAC 2005), Lecture notes in computer science, 3827, 964\u201373, (2005)","DOI":"10.1007\/11602613_96"},{"issue":"5","key":"1687_CR10","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":"2\u20133","key":"1687_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0166-218X(01)00189-5","volume":"113","author":"W Liang","year":"2001","unstructured":"Liang, W.: Finding the $k$ most vital edges with respect to minimum spanning trees for fixed $k$. Dis. Appl. Math. 113(2\u20133), 319\u2013327 (2001)","journal-title":"Dis. Appl. Math."},{"issue":"13","key":"1687_CR12","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":"1687_CR13","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":"1687_CR14","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":"1687_CR15","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":"1687_CR16","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":"1687_CR17","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 inequalities, integrality gaps and approximability. Oper. Res. Lett. 38, 33\u201338 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1687_CR18","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":"1687_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-18173-8_3","volume":"9079","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Nichterlein, A., et al.: A refined complexity analysis of finding the most vital edges for undirected shortest paths: algorithms and complexity. Lecture Notes Comput. Sci. 9079, 47\u201360 (2015)","journal-title":"Lecture Notes Comput. Sci."},{"issue":"3","key":"1687_CR20","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10878-014-9766-5","volume":"29","author":"HL Zhang","year":"2015","unstructured":"Zhang, H.L., Xu, Y.F., Wen, X.G.: Optimal shortest path set problem in undirected graphs. J. Combin. Optim. 29(3), 511\u2013530 (2015)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"1687_CR21","first-page":"441","volume":"68","author":"A Ertugrl","year":"2019","unstructured":"Ertugrl, A., Gokhan, O., Cevriye, T.G.: Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 68(1), 441\u2013450 (2019)","journal-title":"Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat."},{"key":"1687_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00958-0","author":"Q Zhang","year":"2020","unstructured":"Zhang, Q., Guan, X.C., Pardalos, P.M.: Maximum shortest path interdiction problem by upgrading edges on trees under weighted $l_1$ norm. J. Global Optim. (2020). https:\/\/doi.org\/10.1007\/s10898-020-00958-0","journal-title":"J. Global Optim."},{"issue":"4","key":"1687_CR23","doi-asserted-by":"publisher","first-page":"1950018","DOI":"10.1142\/S0217595919500180","volume":"36","author":"A Mohammadi","year":"2019","unstructured":"Mohammadi, A., Tayyebi, J.: Maximum capacity path interdiction problem with fixed costs. Asia Pacific J. Oper. Res. 36(4), 1950018 (2019)","journal-title":"Asia Pacific J. Oper. Res."},{"key":"1687_CR24","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/s10957-018-1221-9","volume":"178","author":"BW Zhang","year":"2018","unstructured":"Zhang, B.W., Guan, X.C., Pardalos, P.M., et al.: An algorithm for solving the shortest path improvement problem on rooted trees under unit hamming distance. J. Optim. Theory Appl. 178, 538\u2013559 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"1687_CR25","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity, Dover Publications, the second edition, (1988)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01687-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01687-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01687-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:28:26Z","timestamp":1632446906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01687-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,6]]},"references-count":25,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1687"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01687-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,6]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}