EconPapers    
Economics at your fingertips  
 

Bounding Network Interdiction Vulnerability Through Cutset Identification

Timothy C. Matisziw (), Alan T. Murray () and Tony H. Grubesic ()
Additional contact information
Timothy C. Matisziw: The Ohio State University
Alan T. Murray: The Ohio State University
Tony H. Grubesic: Indiana University

Chapter 12 in Critical Infrastructure, 2007, pp 243-256 from Springer

Abstract: Abstract Assessing the vulnerability of network infrastructure to disruptive events is recognized as an important component of network planning and analysis. Motivations for this type of research range from searching for the most effective/ efficient means of disrupting a network (e.g., preventing drug trafficking — see Wood 1993) to assessing possible threats to critical network infrastructures so that adequate protective measures can be devised to limit potential disruption (see Wu 1992). In such analysis, the disruptive activity being examined, whether due to natural disaster, accident, or sabotage, can be generically referred to as network interdiction.

Keywords: Naval Research Logistics; Operation Research Letter; Stochastic Integer Program; Network Vulnerability; Network Risk (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (6)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:adspcp:978-3-540-68056-7_12

Ordering information: This item can be ordered from
http://www.springer.com/9783540680567

DOI: 10.1007/978-3-540-68056-7_12

Access Statistics for this chapter

More chapters in Advances in Spatial Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-01
Handle: RePEc:spr:adspcp:978-3-540-68056-7_12