{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T03:47:10Z","timestamp":1780112830719,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642019289","type":"print"},{"value":"9783642019296","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01929-6_9","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"102-116","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Interdiction of Unreactive Markovian Evaders"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Gutfraind","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aric","family":"Hagberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","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. Oper. Res. Lett.\u00a01(4), 157\u2013160 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9_CR2","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\u2013268 (1970)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"9_CR3","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"},{"issue":"8","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.3201\/eid1108.040449","volume":"11","author":"B. Pourbohloul","year":"2005","unstructured":"Pourbohloul, B., Meyers, L., Skowronski, D., Krajden, M., Patrick, D., Brunham, R.: Modeling control strategies of respiratory pathogens. Emerg. Infect. Dis.\u00a011(8), 1246\u20131256 (2005)","journal-title":"Emerg. Infect. Dis."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1080\/10576100390242857","volume":"26","author":"J.D. Farley","year":"2003","unstructured":"Farley, J.D.: Breaking Al Qaeda cells: A mathematical analysis of counterterrorism operations (a guide for risk assessment and decision making). Studies in Conflict and Terrorism\u00a026, 399\u2013411 (2003)","journal-title":"Studies in Conflict and Terrorism"},{"key":"9_CR6","first-page":"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. (ed.) Network Interdiction and Stochastic Integer Programming, pp. 1\u201319. Kluwer Academic Publishers, Boston (2003)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"M.O. Ball","year":"1989","unstructured":"Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Oper. Res. Lett.\u00a08(2), 73\u201376 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9_CR8","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report, University of Maryland, College Park, MD, USA (1995)"},{"key":"9_CR9","unstructured":"Boros, E., Borys, K., Gurevich, V.: Inapproximability bounds for shortest-path network intediction problems. Technical report, Rutgers University, Piscataway, NJ, USA (2006)"},{"key":"9_CR10","unstructured":"Gutfraind, A., Hagberg, A., Izraelevitz, D., Pan, F.: Interdicting a Markovian evader (preprint) (2009)"},{"key":"9_CR11","unstructured":"Grinstead, C.M., Snell, J.L.: Introduction to Probability. Second revised edn. American Mathematical Society, USA (July 1997)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions-I. Mathematical Programming\u00a014, 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Information Processing Letters\u00a070(1), 39\u201345 (1999)","journal-title":"Information Processing Letters"},{"key":"9_CR15","unstructured":"Krause, A., Guestrin, C.: A note on the budgeted maximization on submodular functions. Technical report, Carnegie Mellon University, CMU-CALD-05-103 (2005)"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/1281192.1281239","volume-title":"KDD 2007: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"J. Leskovec","year":"2007","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD 2007: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 420\u2013429. ACM, New York (2007)"},{"key":"9_CR17","unstructured":"Bradonji\u0107, M., Kong, J.S.: Wireless ad hoc networks with tunable topology. In: Forty-Fifth Annual Allerton Conference, UIUC, Illinois, USA, pp. 1170\u20131177 (2007)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01929-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T05:15:38Z","timestamp":1684991738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}