{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:31:51Z","timestamp":1767137511870,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_37","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vulnerability Assessment of Spatial Networks: Models and Solutions"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"\u00c1lvarez-Miranda","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Candia-V\u00e9jar","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Carrizosa","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"P\u00e9rez-Galarce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"6","key":"37_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"N Assimakopoulos","year":"1987","unstructured":"Assimakopoulos, N.: A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413\u2013422 (1987)","journal-title":"Comput. Biol. Med."},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"R Church","year":"2004","unstructured":"Church, R., Scaparra, M., Middleton, R.: Identifying critical infrastructure: the median and covering facility interdiction problems. Ann. Assoc. Am. Geogr. 94(3), 491\u2013502 (2004)","journal-title":"Ann. Assoc. Am. Geogr."},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"K Cormican","year":"1998","unstructured":"Cormican, K., Morton, D., Wood, R.: Stochastic network interdiction. Oper. Res. 46(2), 184\u2013197 (1998)","journal-title":"Oper. Res."},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D Fulkerson","year":"1977","unstructured":"Fulkerson, D., Harding, G.: Maximizing the minimum source-sink path subject to a budget constraint. Math. Program. 13(1), 116\u2013118 (1977)","journal-title":"Math. Program."},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B Golden","year":"1978","unstructured":"Golden, B.: A problem in network interdiction. Nav. Res. Logist. Q. 25(4), 711\u2013713 (1978)","journal-title":"Nav. Res. Logist. Q."},{"key":"37_CR6","unstructured":"Google. Google Maps (2013)"},{"key":"37_CR7","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/0-306-48109-X_4","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke, R., Sch\u00fcltz, R., Woodruff, D.: Interdicting stochastic networks with binary interdiction effort. In: Woodruff, D. (ed.) Network Interdiction and Stochastic Integer Programming. Operations Research\/Computer Science Interfaces Series, vol. 22, pp. 69\u201384. Springer, New York (2003)"},{"issue":"2","key":"37_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.: Shortest-path network interdiction. Networks 40(2), 97\u2013111 (2002)","journal-title":"Networks"},{"issue":"2","key":"37_CR9","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. Theor. Comput. Syst. 43(2), 204\u2013233 (2008)","journal-title":"Theor. Comput. Syst."},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10708-011-9412-z","volume":"78","author":"A Murray","year":"2013","unstructured":"Murray, A.: An overview of network vulnerability modeling approaches. GeoJournal 78(2), 209\u2013221 (2013)","journal-title":"GeoJournal"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Phillips, C.: The network inhibition problem. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC\u201993, pp. 776\u2013785. ACM (1993)","DOI":"10.1145\/167088.167286"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/TPWRS.2008.2004825","volume":"24","author":"J Salmeron","year":"2009","unstructured":"Salmeron, J., Wood, K., Baldick, R.: Worst-case interdiction analysis of large-scale electric power grids. IEEE Trans. Power Syst. 24(1), 96\u2013104 (2009)","journal-title":"IEEE Trans. Power Syst."},{"key":"37_CR13","unstructured":"United Nations Statistics Division. UNSD Statistical Databases (2013)"},{"issue":"6","key":"37_CR14","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R Wollmer","year":"1964","unstructured":"Wollmer, R.: Removing arcs from a network. Oper. Res. 12(6), 934\u2013940 (1964)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:11:23Z","timestamp":1703193083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":14,"aliases":["10.1007\/978-3-319-14115-2_37"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}