{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T17:39:25Z","timestamp":1773164365339,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471073"],"award-info":[{"award-number":["11471073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"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":["J Glob Optim"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10898-020-00958-0","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T04:32:04Z","timestamp":1602045124000},"page":"959-987","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm"],"prefix":"10.1007","volume":"79","author":[{"given":"Qiao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-1868","authenticated-orcid":false,"given":"Xiucui","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"key":"958_CR1","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes, Technical Report CS-TR-3539. University of Maryland, Department of Computer Science (1995)"},{"key":"958_CR2","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. Lect. Notes Comput. Sci. 9079, 47\u201360 (2015)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"958_CR3","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. Comb. Optim. 25(2), 191\u2013207 (2013)","journal-title":"J. Comb. Optim."},{"key":"958_CR4","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":"11","key":"958_CR5","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":"958_CR6","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":"1","key":"958_CR7","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":"958_CR8","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), pp. 539\u2013546 (1996)"},{"issue":"1","key":"958_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.1997.0856","volume":"24","author":"SE Hambrusch","year":"1997","unstructured":"Hambrusch, S.E., Tu, H.Y.: Edge weight reduction problems in directed acyclic graphs. J. Algorithms 24(1), 66\u201393 (1997)","journal-title":"J. Algorithms"},{"issue":"5","key":"958_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\u2013211-213 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"958_CR11","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."},{"issue":"2\u20133","key":"958_CR12","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$$. Discrete Appl. Math. 113(2\u20133), 319\u2013327 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"958_CR13","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":"958_CR14","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1988","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity, 2nd edn. Dover Publications, New York (1988)","edition":"2"},{"key":"958_CR15","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, pp. 964\u201373 (2005)","DOI":"10.1007\/11602613_96"},{"issue":"1","key":"958_CR16","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., de Costa, M., Zenklusen, R.: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. Discrete Math. 310(1), 132\u2013146 (2010)","journal-title":"Discrete Math."},{"issue":"15","key":"958_CR17","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. Discrete Appl. Math. 158(15), 1676\u20131690 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"958_CR18","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. Discrete Appl. Math. 158(13), 1441\u20131455 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"958_CR19","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., de Werra, D., Costa, M., Bentz, C.: Blockers and transversals. Discrete Math. 309(13), 4306\u20134314 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"958_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."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00958-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T05:30:50Z","timestamp":1615872650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00958-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,7]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["958"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00958-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,7]]},"assertion":[{"value":"18 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}