Solving multi-period interdiction via generalized Bender’s decomposition

  • Maryam Soleimani-AlyarEmail author
  • Alireza Ghaffari-Hadigheh


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.


Bi-level programming network interdiction mixed-integer nonlinear programming generalized benders decomposition 

2000 MR Subject Classification



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



The authors would like to thank Azarbaijan Shahid Madani University for supporting this paper.


  1. [1]
    Department of Homeland Security (DHS). A roadmap for cybersecurity research. Department of Homeland Security (DHS), Technical Report, November, 2009Google Scholar
  2. [2]
    Allende, G.B., Still, G. Solving bilevel programs with the KKT-approach. Math. Program., Ser. A, 138: 309–332 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    Chang, C.T. An efficient linearization approach for mixed-integer problems. European Journal of Operational Research, 123(3): 652–659 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Corely, H.W., Sha, D.Y. Most vital links and nodes in weighted network. Operations Research Letters, 1: 157–160 (1982)MathSciNetCrossRefGoogle Scholar
  5. [5]
    Cormican, K.J., Morton, D.P., Wood, R.K. Stochastic network interdiction. Operations Research, 46: 184–197 (1998)CrossRefzbMATHGoogle Scholar
  6. [6]
    DeNegre, S. Interdiction and discrete bilevel linear programming. Doctoral disssertation, Lehigh University, 2011Google Scholar
  7. [7]
    Fulkerson, D.R., Harding, G.C. Maximizing the minimum source-sink path subject to budget constraint. Mathematical Programming, 13: 116–118 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    Geoffrion, A.M. Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4): 237–260 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    Glover, F. Improved linear integer programming formulations of nonlinear integer problems. Management Science, 22(4): 455469 (1975)MathSciNetCrossRefGoogle Scholar
  10. [10]
    Golden, B. A problem in network interdiction. Naval Research Logistics Quarterly, 25: 711–713 (1978)CrossRefzbMATHGoogle Scholar
  11. [11]
    Israeli, E., Wood, R.K. Shortest-path network interdiction. Networks, 40(2): 97–111 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  12. [12]
    Gm, H.Z., Floudas, A.C. Global optimization of mixed-integer bilevel programming problems. Computational Management Science, 2(3): 181–212 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    Kettani, O. Oral, M. Equivalent formulations of nonlinear integer problems for efficient optimization. Management Science, 36(1): 115119 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [14]
    Klaus, C. Network design for reliablity and resilience to attack. Doctoral disssertation, Naval Postgraduate School, 2014Google Scholar
  15. [15]
    Larsson, T., Yuan, D. An augmente lagrangean algorithm for large scale multicommodity routing. Computational Optimization and Applications, 27 (2): 187–215 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  16. [16]
    Malaviya, A., Rainwater, C., Sharkey, T. Multi-period network interdiction problems with applications to city-level drug enforcement. IIE Transactions, 44: 368–380 (2012)CrossRefGoogle Scholar
  17. [17]
    McMasters, A.W., Mustin, T.M. Optimal interdiction of a supply network. Naval Research Logistics Quarterly, 17: 261–268 (1970)CrossRefzbMATHGoogle Scholar
  18. [18]
    Saharidis, G.K. Ierapetritou, M.G. Resolution method for mixed integer bi-level linear problems based on decomposition technique. J. Glob. Optim., 44: 20–51 (2008)MathSciNetzbMATHGoogle Scholar
  19. [19]
    Stackelberg, H. The Theory of the Market Economy. William Hodge and Co., London, U.K., 1952Google Scholar
  20. [20]
    Sterbenz, J.P.G., Hutchison, D., Cetinkaya, E.K., Jabbar, A., Rohrer, J.P., Scholler, M., Smith, P. Resilience and survivability in communication networks: strategies, principles, and survey of disciplines. Computer Networks, 54(8): 12451265 (2010)CrossRefzbMATHGoogle Scholar
  21. [21]
    Wen, U. Yang, Y. Algorithms for solving the mixed integer two-level linear programming problem. Comput. Oper. Res., 17: 133–142 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  22. [22]
    Wollmer, R.D. Removing arcs from a network. Operations Research, 12: 934–940 (1964)MathSciNetCrossRefzbMATHGoogle Scholar
  23. [23]
    Wood, R.K. Deteministic network interdiction. Mathematical and Computer Modeling, 17: 1–18 (1993)CrossRefzbMATHGoogle Scholar
  24. [24]
    Woodruff, D.L. Network interdiction and stochastic integer programming. Kluwer Academic Publishers, 2003CrossRefzbMATHGoogle Scholar

Copyright information

© Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Maryam Soleimani-Alyar
    • 1
    Email author
  • Alireza Ghaffari-Hadigheh
    • 1
  1. 1.Department of Applied MathematicsAzarbaijan Shahid Madani UniversityTabrizIran

Personalised recommendations