• بیگدلی، حمید.، طیبی، جواد. (1396). ارایه یک مدل و روش حل بازی‌های امنیتی فازی و کاربرد آن در آینده‌‌پژوهی تهدیدات امنیتی.  آینده‌پژوهی دفاعی، 2 (6)، 7-29.
• بیگدلی، حمید.، طیبی، جواد. (1397). روش برنامه‌ریزی ریاضی برای حل و مدل‌سازی سناریوهای نبرد در سامانه پشتیبان تصمیم بازی جنگ تاکتیکی و عملیاتی. آینده‌پژوهی دفاعی. 3 (9) 35-56.
• Abdolahzadeh, A., Aman, M., & Tayyebi, J. (2020). Minimum st-cut interdiction problem. Computers & Industrial Engineering, 148, 106708.
• Ahuja, R. K., Magnanti, T. L., & Flows, J. O. N. (1993). Theory, algorithms, and applications. In Network flows.‏
• Atamtürk, A., Deck, C., & Jeon, H. (2020). Successive quadratic upper bounding for discrete mean-risk minimization and network interdiction. INFORMS Journal on Computing, 32(2), 346-355.
• Forghani, A., Dehghanian, F., Salari, M., & Ghiami, Y. (2020). A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities. Computers & Operations Research, 114, 104831.
• Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116-118.‏
• Gibbons, R. (1997). An introduction to applicable game theory. Journal of Economic Perspectives, 11(1), 127-149.
• Jabarzare, Z., Zolfagharinia, H., & Najafi, M. (2020). Dynamic interdiction networks with applications in illicit supply chains. Omega, 96, 102069.
• Kodialam, M., & Lakshman, T. V. (2003, March). Detecting network intrusions via sampling: a game theoretic approach. In IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428)(Vol. 3, pp. 1880-1889). IEEE.
• Lim, C., & Smith, J. C. (2007). Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15-26.
• Mohammadi, A., & Tayyebi, J. (2019). Maximum Capacity Path Interdiction Problem with Fixed Costs. Asia-Pacific Journal of Operational Research, 36(04), 1950018.‏
• Pan, F., Charlton, W. S., & Morton, D. P. (2003). A stochastic program for interdicting smuggled nuclear material. In Network interdiction and stochastic integer programming(pp. 1-19). Springer, Boston, MA.
• Salmeron, J., Wood, K., & Baldick, R. (2004). Analysis of electric grid security under terrorist threat. IEEE Transactions on power systems, 19(2), 905-912.‏
• Smith, J. C., & Song, Y. (2020). A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3), 797-811.
• Steinrauf, R. L. (1991). Network interdiction models. Naval Postgraduate School Monterey Ca.‏
• Washburn, A., & Wood, K. (1995). Two-person zero-sum games for network interdiction. Operations research, 43(2), 243-251.
• Whiteman, P. S. B. (1999). Improving single strike effectiveness for network interdiction. Military Operations Research, 15-30.‏
• Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1-18.‏
• Wood, R. K. (2010). Bilevel network interdiction models: Formulations and solutions. Wiley encyclopedia of operations research and management science.

Xiao, K., Zhu, C., Zhang, W., & Wei, X. (2020). The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property. IEEE Access, 8, 146535-146547.‏