{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T20:09:56Z","timestamp":1776370196087,"version":"3.51.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T00:00:00Z","timestamp":1155081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T00:00:00Z","timestamp":1155081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10898-006-9067-3","type":"journal-article","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T07:28:06Z","timestamp":1155022086000},"page":"181-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":72,"title":["Survivable network design under optimal and heuristic interdiction scenarios"],"prefix":"10.1007","volume":"38","author":[{"given":"J. Cole.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Churlzu","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fransisca","family":"Sudargho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,9]]},"reference":[{"key":"9067_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/35.663332","volume":"36","author":"D. Alevras","year":"1998","unstructured":"Alevras D., Gr\u00f6tschel M., Jonas P., Paul U., Wessaly R. (1998) Survivable mobile phone network architectures: Models and solution methods. IEEE Commun. Magazine 36, 88\u201393","journal-title":"IEEE Commun. Magazine"},{"key":"9067_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1287\/moor.8.2.260","volume":"8","author":"J. Bard","year":"1983","unstructured":"Bard J. (1983) An algorithm for solving the general bilevel programming problem. Math. Oper. Res. 8, 260\u2013272","journal-title":"Math. Oper. Res."},{"key":"9067_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization: Algorithms and Applications","author":"J. Bard","year":"1998","unstructured":"Bard J. (1998) Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Norwell MA"},{"key":"9067_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"J. Bard","year":"1982","unstructured":"Bard J., Falk J. (1982) An explicit solution to the multilevel programming problem. Comput. Oper. Res. 9, 77\u2013100","journal-title":"Comput. Oper. Res."},{"key":"9067_CR5","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"W. Bialas","year":"1984","unstructured":"Bialas W., Karwan M. (1984) Two-level linear programming. Manag. Sci. 30, 1004\u20131021","journal-title":"Manag. Sci."},{"key":"9067_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J. Bracken","year":"1973","unstructured":"Bracken J., McGill J. (1973) Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 37\u201344","journal-title":"Oper. Res."},{"key":"9067_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0305-0548(82)90006-5","volume":"9","author":"W. Candler","year":"1982","unstructured":"Candler W., Townsley R. (1982) A linear two-level programming problem. Comput. Oper. Res. 9, 59\u201376","journal-title":"Comput. Oper. Res."},{"key":"9067_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/0305-0548(94)00076-K","volume":"22","author":"L. Clarke","year":"1995","unstructured":"Clarke L., Anandalingam G. (1995) A bootstrap heuristic for designing minimum cost survivable networks. Comput. Oper. Res. 22, 921\u2013934","journal-title":"Comput. Oper. Res."},{"key":"9067_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"P.M.B. Colson","year":"1998","unstructured":"Colson P.M. B., Savard G. (1998) A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10, 1\u201311","journal-title":"INFORMS J. Comput."},{"key":"9067_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10288-005-0071-0","volume":"3","author":"P.M.B. Colson","year":"2005","unstructured":"Colson P.M.B., Savard G. (2005) Bilevel programming: a survey. 4OR. 3: 87\u2013107","journal-title":"4OR"},{"issue":"2","key":"9067_CR11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"K.J. Cormican","year":"1998","unstructured":"Cormican K.J., Morton D.P., Wood R.K. (1998) Stochastic network interdiction. Oper. Res. 46(2): 184\u2013196","journal-title":"Oper. Res."},{"key":"9067_CR12","doi-asserted-by":"publisher","first-page":"783","DOI":"10.2307\/2581394","volume":"32","author":"J. Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat J., McCarl B. (1981) A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32, 783\u2013792","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9067_CR13","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D.R. Fulkerson","year":"1977","unstructured":"Fulkerson D.R., Harding G.C. (1977) Maximizing minimum source-sink path subject to a budget constraint. Math. Program. 13(1): 116\u2013118","journal-title":"Math. Program."},{"key":"9067_CR14","unstructured":"Garg M., Smith J.C.: Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios. OMEGA, to appear (2006)"},{"issue":"2","key":"9067_CR15","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. (2002) Shortest-path network interdiction. Networks 40(2): 97\u2013111","journal-title":"Networks"},{"key":"9067_CR16","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1287\/mnsc.21.9.1029","volume":"21","author":"F. Kydland","year":"1975","unstructured":"Kydland F. (1975) Hierarchical decomposition in linear economic models. Manag. Sci. 21, 1029\u20131039","journal-title":"Manag. Sci."},{"key":"9067_CR17","doi-asserted-by":"crossref","unstructured":"Lim C., Smith J.C.: Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans., to appear (2006)","DOI":"10.1080\/07408170600729192"},{"issue":"1","key":"9067_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"L.T. Magnanti","year":"1984","unstructured":"Magnanti L.T., Wong R.T. (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1): 1\u201355","journal-title":"Transportation Sci."},{"issue":"3","key":"9067_CR19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux M. (1989) Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19(3): 313\u2013360","journal-title":"Networks"},{"key":"9067_CR20","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/mnsc.45.2.238","volume":"45","author":"Y.S. Myung","year":"1999","unstructured":"Myung Y.S., Kim H.J., Tcha D.W. (1999) Design of communication networks with survivability constraints. Manag. Sci. 45, 238\u2013252","journal-title":"Manag. Sci."},{"key":"9067_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/S0377-2217(98)00015-0","volume":"117","author":"I. Ouveysi","year":"1999","unstructured":"Ouveysi I., Wirth A. (1999) On design of a survivable network architecture for dynamic routing: Optimal solution strategy and efficient heuristic. Eur. J. Oper. Res. 117, 30\u201344","journal-title":"Eur. J. Oper. Res."},{"key":"9067_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1140\/epjb\/e2004-00112-3","volume":"38","author":"G. Paul","year":"2004","unstructured":"Paul G., Tanizawa T., Havlin S., Stanley H.E. (2004) Optimization of robustness of complex networks. Eur. Phys. J. B 38, 187\u2013191","journal-title":"Eur. Phys. J. B"},{"key":"9067_CR23","first-page":"65","volume-title":"Telecommunication Network Design and Management.","author":"D. Rajan","year":"2002","unstructured":"Rajan D., Atamt\u00fcrk A. (2002) Survivable network design: routing of flows and slacks. In: Anandalingam G., Raghavan S. (ed) Telecommunication Network Design and Management. Kluwer Academic Publishers Dordrecht, Boston London, pp. 65\u20138"},{"key":"9067_CR24","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1057\/palgrave.jors.2600913","volume":"51","author":"M. R\u00edos","year":"2000","unstructured":"R\u00edos M., Marianov V., Gutierrez M. (2000) Survivable capacitated network design problem: New formulation and lagrangian relaxation. J. Oper. Res. Soc. 51, 574\u2013582","journal-title":"J. Oper. Res. Soc."},{"key":"9067_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1014561725448","volume":"106","author":"J. Shaio","year":"2001","unstructured":"Shaio J. (2001) Constraint generation for network reliability problems. Ann. Oper. Res. 106, 155\u2013180","journal-title":"Ann. Oper. Res."},{"key":"9067_CR26","first-page":"225","volume-title":"Survivable network design under various interdiction scenarios","author":"J.C. Smith","year":"2005","unstructured":"Smith J.C., Sudargho F., Lim C. (2005) Survivable network design under various interdiction scenarios. San Jos\u00e9, Spain, pp. 225\u2013230"},{"key":"9067_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"L. Vicente","year":"1994","unstructured":"Vicente L., Calamai P. (1994) Bilevel and multilevel programming\u2014a bibliography review. J. Glob. Optim. 5, 291\u2013306","journal-title":"J. Glob. Optim."},{"issue":"6","key":"9067_CR28","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R. Wollmer","year":"1964","unstructured":"Wollmer R. (1964) Removing arcs from a network. Oper. Res. 12(6): 934\u2013940","journal-title":"Oper. Res."},{"issue":"2","key":"9067_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1993","unstructured":"Wood R.K. (1993) Deterministic network interdiction. Math. Comput. Model. 17(2): 1\u201318","journal-title":"Math. Comput. Model."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9067-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-006-9067-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9067-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9067-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T18:13:04Z","timestamp":1652811184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-006-9067-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9067"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9067-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,9]]},"assertion":[{"value":"3 January 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}