Evader interdiction: algorithms, complexity and collateral damage
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-013-1372-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Alan W. McMasters & Thomas M. Mustin, 1970. "Optimal interdiction of a supply network," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(3), pages 261-268, September.
- H. W. Corley, Jr. & Han Chang, 1974. "Finding the n Most Vital Nodes in a Flow Network," Management Science, INFORMS, vol. 21(3), pages 362-364, November.
- H. Donald Ratliff & G. Thomas Sicilia & S. H. Lubore, 1975. "Finding the n Most Vital Links in Flow Networks," Management Science, INFORMS, vol. 21(5), pages 531-539, January.
- Nimrod Megiddo, 1981. "The Maximum Coverage Location Problem," Discussion Papers 490, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- , & ,, 2006. "A study in the pragmatics of persuasion: a game theoretical approach," Theoretical Economics, Econometric Society, vol. 1(4), pages 395-410, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Zhang, Jing & Zhuang, Jun & Behlendorf, Brandon, 2018. "Stochastic shortest path network interdiction with a case study of Arizona–Mexico border," Reliability Engineering and System Safety, Elsevier, vol. 179(C), pages 62-73.
- Jing Yang & Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2021. "Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback," Decision Analysis, INFORMS, vol. 18(3), pages 218-244, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
- Alan Murray & Timothy Matisziw & Tony Grubesic, 2007. "Critical network infrastructure analysis: interdiction and system flow," Journal of Geographical Systems, Springer, vol. 9(2), pages 103-117, June.
- Jabarzare, Ziba & Zolfagharinia, Hossein & Najafi, Mehdi, 2020. "Dynamic interdiction networks with applications in illicit supply chains," Omega, Elsevier, vol. 96(C).
- Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
- Kosanoglu, Fuat & Bier, Vicki M., 2020. "Target-oriented utility for interdiction of transportation networks," Reliability Engineering and System Safety, Elsevier, vol. 197(C).
- Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
- Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
- Winand Emons & Claude Fluet, 2019.
"Strategic communication with reporting costs,"
Theory and Decision, Springer, vol. 87(3), pages 341-363, October.
- Claude Fluet & Winand Emons, 2016. "Strategic Communication with Reporting Costs," Diskussionsschriften dp1601, Universitaet Bern, Departement Volkswirtschaft.
- Winand Emons & Claude Denys Fluet, 2016. "Strategic Communication with Reporting Costs," CIRANO Working Papers 2016s-06, CIRANO.
- Emons, Winand & Fluet, Claude, 2016. "Strategic Communication with Reporting Costs," CEPR Discussion Papers 11105, C.E.P.R. Discussion Papers.
- Evans, R., Reiche, S. & Reiche, S., 2022. "When is a Contrarian Adviser Optimal?," Cambridge Working Papers in Economics 2222, Faculty of Economics, University of Cambridge.
- Sergiu Hart & Ilan Kremer & Motty Perry, 2017.
"Evidence Games: Truth and Commitment,"
American Economic Review, American Economic Association, vol. 107(3), pages 690-713, March.
- Hart, Sergiu & Kremer, Ilan & Perry, Motty, 2015. "Evidence Games : Truth and Commitment," The Warwick Economics Research Paper Series (TWERPS) 1091, University of Warwick, Department of Economics.
- Hart, Sergiu & Kremer, Ilan & Perry, Motty, 2015. "Evidence Games: Truth and Commitment," Economic Research Papers 270003, University of Warwick - Department of Economics.
- Hart, Sergiu & Kremer, Ilan & Perry, Motty, 2015. "Evidence Games : Truth and Commitment," CRETA Online Discussion Paper Series 06, Centre for Research in Economic Theory and its Applications CRETA.
- Sergiu Hart & Ilan Kremer & Motty Perry, 2015. "Evidence Games: Truth and Commitment," Discussion Paper Series dp684, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Strausz, Roland, 2017. "Mechanism Design with Partially Verifiable Information," Rationality and Competition Discussion Paper Series 45, CRC TRR 190 Rationality and Competition.
- Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
- Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
- Elchanan Ben-Porath & Eddie Dekel & Barton L Lipman, 2018.
"Disclosure and Choice,"
The Review of Economic Studies, Review of Economic Studies Ltd, vol. 85(3), pages 1471-1501.
- Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Disclosure and Choice," Boston University - Department of Economics - Working Papers Series WP2017-002, Boston University - Department of Economics, revised Jan 2017.
- Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2016. "Disclosure and Choice," Discussion Paper Series dp694, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
- Elliot Lipnowski & Doron Ravid, 2020. "Cheap Talk With Transparent Motives," Econometrica, Econometric Society, vol. 88(4), pages 1631-1660, July.
- Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka, 2016. "Maximal Covering Location Problems on networks with regional demand," Omega, Elsevier, vol. 64(C), pages 77-85.
- Matthias Lang, 2020. "Mechanism Design with Narratives," CESifo Working Paper Series 8502, CESifo.
- Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten, 2013. "Critical edges/nodes for the minimum spanning tree problem: complexity and approximation," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 178-189, July.
- Rodríguez-Núñez, Eduardo & García-Palomares, Juan Carlos, 2014. "Measuring the vulnerability of public transport networks," Journal of Transport Geography, Elsevier, vol. 35(C), pages 50-63.
More about this item
Keywords
Network interdiction; Bridge policy; Submodular set cover; Markov chain; Minimal cut; Four color theorem;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:222:y:2014:i:1:p:341-359:10.1007/s10479-013-1372-x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.