Solving multi-period interdiction via generalized Bender’s decomposition
- 53 Downloads
This paper considers a novel formulation of the multi-period network interdiction problem. In this model, delivery of the maximum flow as well as the act of interdiction happens over several periods, while the budget of resource for interdiction is limit. It is assumed that when an edge is interdicted in a period, the evader considers a rate of risk of detection at consequent periods. Application of the generalized Benders decomposition algorithm considers solving the resulting mixed-integer nonlinear programming problem. Computational experiences denote reasonable consistency with expectations.
KeywordsBi-level programming network interdiction mixed-integer nonlinear programming generalized benders decomposition
2000 MR Subject Classification90B10
Unable to display preview. Download preview PDF.
The authors would like to thank Azarbaijan Shahid Madani University for supporting this paper.
- Department of Homeland Security (DHS). A roadmap for cybersecurity research. Department of Homeland Security (DHS), Technical Report, November, 2009Google Scholar
- DeNegre, S. Interdiction and discrete bilevel linear programming. Doctoral disssertation, Lehigh University, 2011Google Scholar
- Klaus, C. Network design for reliablity and resilience to attack. Doctoral disssertation, Naval Postgraduate School, 2014Google Scholar
- Stackelberg, H. The Theory of the Market Economy. William Hodge and Co., London, U.K., 1952Google Scholar