{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:47Z","timestamp":1725557987109},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_25","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"219-231","source":"Crossref","is-referenced-by-count":1,"title":["Matrix Interdiction Problem"],"prefix":"10.1007","author":[{"given":"Shiva Prasad","family":"Kasiviswanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM (JACM)\u00a045(3), 555 (1998)","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"25_CR2","doi-asserted-by":"crossref","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.\u00a017(6), 413\u2013422 (1987)","journal-title":"Comput. Biol. Med."},{"key":"25_CR3","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report, University of Maryland (1995)"},{"key":"25_CR4","volume-title":"Introduction to stochastic programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer, New York (1997)"},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1002\/nav.20349","volume":"56","author":"E. Boros","year":"2009","unstructured":"Boros, E., Fedzhora, L., Kantor, P.B., Saeger, K., Stroud, P.: Large scale lp model for finding optimal container inspection strategies. Naval Research Logistics Quarterly\u00a056(5), 404\u2013420 (2009)","journal-title":"Naval Research Logistics Quarterly"},{"key":"25_CR6","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/0-306-48109-X_3","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"C. Burch","year":"2003","unstructured":"Burch, C., Carr, R., Krumke, S., Marathe, M., Phillips, C., Sundberg, E.: A decomposition-based pseudoapproximation algorithm for network flow inhibition. In: Network Interdiction and Stochastic Integer Programming. Operations Research\/Computer Science Interfaces, vol.\u00a022, pp. 51\u201368. Springer, US (2003)"},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H.W. Corley","year":"1982","unstructured":"Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters\u00a01(4), 157\u2013160 (1982)","journal-title":"Operations Research Letters"},{"key":"25_CR8","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge (2001)"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","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, K.R.: Stochastic network interdiction. Operations Research\u00a046(2), 184\u2013197 (1998)","journal-title":"Operations Research"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Dimitrov, N., Michalopoulos, D.P., Morton, D.P., Nehme, M.V., Pan, F., Popova, E., Schneider, E.A., Thoreson, G.G.: Network deployment of radiation detectors with physics-based detection probability calculations. Annals of Operations Research (2009)","DOI":"10.1007\/s10479-009-0677-2"},{"key":"25_CR11","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-0-387-88843-9_9","volume-title":"Operations Research and Cyber-Infrastructure","author":"N.B. Dimitrov","year":"2009","unstructured":"Dimitrov, N.B., Morton, D.P.: Combinatorial design of a stochastic markov decision process. In: Operations Research and Cyber-Infrastructure. Operations Research\/Computer Science Interfaces, vol.\u00a047, pp. 167\u2013193. Springer, Heidelberg (2009)"},{"issue":"1","key":"25_CR12","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.: Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming\u00a013(1), 116\u2013118 (1977)","journal-title":"Mathematical Programming"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/nav.3800180103","volume":"18","author":"P.M. Ghare","year":"1971","unstructured":"Ghare, P.M., Montgomery, D.C., Turner, W.C.: Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly\u00a018(1), 37 (1971)","journal-title":"Naval Research Logistics Quarterly"},{"key":"25_CR14","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. Naval Research Logistics Quarterly\u00a025, 711\u2013713 (1978)","journal-title":"Naval Research Logistics Quarterly"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-01929-6_9","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A. Gutfraind","year":"2009","unstructured":"Gutfraind, A., Hagberg, A., Pan, F.: Optimal interdiction of unreactive markovian evaders. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 102\u2013116. Springer, Heidelberg (2009)"},{"volume-title":"Approximation algorithms for NP-hard problems","year":"1997","key":"25_CR16","unstructured":"Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston (1997)"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E. Israeli","year":"2002","unstructured":"Israeli, E., Kevin Wood, R.: Shortest-path network interdiction. Networks\u00a040(2), 97\u2013111 (2002)","journal-title":"Networks"},{"issue":"3","key":"25_CR18","first-page":"263","volume":"32","author":"S. Karabati","year":"2000","unstructured":"Karabati, S., Kouveils, P.: A min-sum-max resource allocation problem. IEE Transactions\u00a032(3), 263\u2013271 (2000)","journal-title":"IEE Transactions"},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"A.W. McMasters","year":"1970","unstructured":"McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Research Logistics Quarterly\u00a017(3), 261 (1970)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/07408170500488956","volume":"39","author":"D.P. Morton","year":"2007","unstructured":"Morton, D.P., Pan, F., Saeger, K.J.: Models for nuclear smuggling interdiction. IIE Transactions\u00a039(1), 3\u201314 (2007)","journal-title":"IIE Transactions"},{"key":"25_CR21","unstructured":"Pan, F.: Stochastic Network Interdiction: Models and Methods. PhD dissertation, University of Texas at Austin, Operations Research (2005)"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48109-X_1","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"F. Pan","year":"2003","unstructured":"Pan, F., Charlton, W., Morton, D.P.: Interdicting smuggled nuclear material. In: Woodruff, D.L. (ed.) Network Interdiction and Stochastic Integer Programming, pp. 1\u201319. Kluwer Academic Publishers, Boston (2003)"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/net.20238","volume":"52","author":"F. Pan","year":"2008","unstructured":"Pan, F., Morton, D.P.: Minimizing a stochastic maximum-reliability path. Networks\u00a052(3), 111\u2013119 (2008)","journal-title":"Networks"},{"issue":"1","key":"25_CR24","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 Transactions on Power Systems\u00a024(1), 96\u2013104 (2009)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A. Washburn","year":"1995","unstructured":"Washburn, A., Wood, K.R.: Two-person zero-sum games for network interdiction. Operations Research\u00a043(2), 243\u2013251 (1995)","journal-title":"Operations Research"},{"issue":"5","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1111\/j.1539-6924.2006.00817.x","volume":"26","author":"L.M. Wein","year":"2006","unstructured":"Wein, L.M., Wilkins, A.H., Baveja, M., Flynn, S.E.: Preventing the importation of illicit nuclear materials in shipping containers. Risk Analysis\u00a026(5), 1377\u20131393 (2006)","journal-title":"Risk Analysis"},{"issue":"6","key":"25_CR27","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. Operations Research\u00a012(6), 934\u2013940 (1964)","journal-title":"Operations Research"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1997","unstructured":"Wood, R.K.: Deterministic network interdiction. Mathematical and Computer Modeling\u00a017, 1\u201318 (1997)","journal-title":"Mathematical and Computer Modeling"},{"key":"25_CR29","unstructured":"Zenklusen, R.: Matching interdiction. Arxiv preprint arXiv:0804.3583 (2008)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:14Z","timestamp":1606185554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}