Abstract
We provide formulations, test instances and benchmark results for a new class of network interdiction problems. The formulations are appropriate for computer, terrorist or drug transportation networks where the characteristics of the network cannot be known completely in advance but rather interdiction must be planned based on conjectured configurations. The models support maximization of the expected minimum path length between two nodes, s and t. We also model maximizing the probability of causing the minimum path length to be above a specified threshold. Examples make our formulations concrete and benchmarks establish the computational requirements for solution. Our benchmarks also help quantify the importance of using a special formulation provided for instances when a cut between s and t is the goal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cormican, K.J., Morton, D.P. and Wood, R.K., “Stochastic Network Interdiction,” Operations Research, 46 (1998) 184–197.
Fulkerson, D.R. and Harding, G.C., “Maximizing the Minimum Source-Sink Path subject to a Budget Constraint”, Mathematical Programming, 13 (1977) 116–118.
Golden, B.L., “A Problem in Network Interdiction,” Naval Research Logistics Quarterly, 25 (1978), 711–713.
Israeli, E. and R.K. Wood, “Shortest-path Network Interdiction,” Networks, to appear.
Phillips, C, “The Network Inhibition Problem,” Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 776–785.
Schultz, R., “Probability Objectives in Stochastic Programs with Recourse,” Technical Report, Mathematics Institute, Gerhard-Mercator University, Duisburg, Germany, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Hemmecke, R., Schultz, R., Woodruff, D.L. (2003). Interdicting Stochastic Networks with Binary Interdiction Effort. In: Woodruff, D.L. (eds) Network Interdiction and Stochastic Integer Programming. Operations Research/Computer Science Interfaces Series, vol 22. Springer, Boston, MA. https://doi.org/10.1007/0-306-48109-X_4
Download citation
DOI: https://doi.org/10.1007/0-306-48109-X_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7302-1
Online ISBN: 978-0-306-48109-3
eBook Packages: Springer Book Archive