{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:52:51Z","timestamp":1761562371725,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1270-x","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T05:49:26Z","timestamp":1525326566000},"page":"695-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal K-node disruption on a node-capacitated network"],"prefix":"10.1007","volume":"13","author":[{"given":"Gokhan","family":"Karakose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8825-8553","authenticated-orcid":false,"given":"Ronald G.","family":"McGarvey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"1270_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"3","key":"1270_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14(3), 205\u2013220 (1967)","journal-title":"Manag. Sci."},{"key":"1270_CR3","volume-title":"Urban Transportation Networks","author":"Y Sheffi","year":"1985","unstructured":"Sheffi, Y.: Urban Transportation Networks. Pretince-Hall, Englewoods Cliffs (1985)"},{"key":"1270_CR4","volume-title":"Fundamentals of a Method for Evaluating Rail Net Capacities","author":"T Harris","year":"1955","unstructured":"Harris, T., Ross, F.: Fundamentals of a Method for Evaluating Rail Net Capacities. RAND Corporation, Santa Monica (1955)"},{"issue":"1","key":"1270_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw, T.C., Murray, A.T.: Modeling s\u2013t path availability to support disaster vulnerability assessment of network infrastructure. Comput. Oper. Res. 36(1), 16\u201326 (2009). https:\/\/doi.org\/10.1016\/j.cor.2007.09.004","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"1270_CR6","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36(7), 2193\u20132200 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.08.016","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1270_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993). https:\/\/doi.org\/10.1016\/0895-7177(93)90236-R","journal-title":"Math. Comput. Model."},{"issue":"2","key":"1270_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Networks 40(2), 97\u2013111 (2002). https:\/\/doi.org\/10.1002\/net.10039","journal-title":"Networks"},{"key":"1270_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tre.2016.12.003","volume":"98","author":"SA Bagloee","year":"2017","unstructured":"Bagloee, S.A., Sarvi, M., Wolshon, B., Dixit, V.: Identifying critical disruption scenarios and a global robustness index tailored to real life road networks. Transp. Res. Part E 98, 60\u201381 (2017). https:\/\/doi.org\/10.1016\/j.tre.2016.12.003","journal-title":"Transp. Res. Part E"},{"issue":"1\u20132","key":"1270_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12198-009-0025-4","volume":"2","author":"SV Ukkusuri","year":"2009","unstructured":"Ukkusuri, S.V., Yushimito, W.F.: A methodology to assess the criticality of highway transportation networks. J. Transp. Secur. 2(1\u20132), 29\u201346 (2009). https:\/\/doi.org\/10.1007\/s12198-009-0025-4","journal-title":"J. Transp. Secur."},{"issue":"1","key":"1270_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1100.0340","volume":"45","author":"P Cappanera","year":"2011","unstructured":"Cappanera, P., Scaparra, M.P.: Optimal allocation of protective resources in shortest-path networks. Transp. Sci. 45(1), 64\u201380 (2011). https:\/\/doi.org\/10.1287\/trsc.1100.0340","journal-title":"Transp. Sci."},{"issue":"4","key":"1270_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","volume":"8","author":"A Veremyev","year":"2014","unstructured":"Veremyev, A., Pasiliao, E.L., Boginski, V.: Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8(4), 1245\u20131259 (2014). https:\/\/doi.org\/10.1007\/s11590-013-0666-x","journal-title":"Optim. Lett."},{"key":"1270_CR13","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optim. 9, 172\u2013188 (2012). https:\/\/doi.org\/10.1016\/j.disopt.2012.07.001","journal-title":"Discrete Optim."},{"issue":"3","key":"1270_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0377-2217(03)00135-8","volume":"156","author":"Y-S Myung","year":"2004","unstructured":"Myung, Y.-S., Kim, H.-J.: A cutting plane algorithm for computing k-edge survivability of a network. Eur. J. Oper. Res. 156(3), 579 (2004). https:\/\/doi.org\/10.1016\/S0377-2217(03)00135-8","journal-title":"Eur. J. Oper. Res."},{"key":"1270_CR15","volume-title":"Algorithms in C, Part 5: Graph Algorithms","author":"R Sedgewick","year":"2001","unstructured":"Sedgewick, R.: Algorithms in C, Part 5: Graph Algorithms, 3rd edn. Addison Wesley Professional, Boston (2001)","edition":"3"},{"issue":"5","key":"1270_CR16","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/10556789908805733","volume":"10","author":"MC Ferris","year":"1999","unstructured":"Ferris, M.C., Meeraus, A., Rutherford, T.F.: Computing Wardropian equilibria in a complementarity framework. Optim. Methods Softw. 10(5), 669\u2013685 (1999). https:\/\/doi.org\/10.1080\/10556789908805733","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1270_CR17","first-page":"343","volume":"38","author":"P Erdos","year":"1961","unstructured":"Erdos, P., R\u00e9nyi, A.: On the evolution of random graphs. Bull. Inst. Int. Stat. 38(4), 343\u2013347 (1961)","journal-title":"Bull. Inst. Int. Stat."},{"key":"1270_CR18","unstructured":"Stabler, B., Bar-Gera, H., Sall, E.: Transportation networks for research. https:\/\/github.com\/bstabler\/TransportationNetworks . Accessed 10-2017"},{"issue":"1","key":"1270_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2012","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2012). https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1270-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1270-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1270-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T13:16:35Z","timestamp":1604236595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1270-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1270-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"14 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}