References

Cormican, K.J., D.P. Morton and R.K. Wood, 1998. Stochastic network interdiction. Oper. Res., 46: 184-197.
Direct Link  |  

Dempe, S., 2002. Foundation of Bilevel Programming. Kluwer Academic Publishers, London, New York, Moscow, ISBN:1-402-0631-4, Pages: 306.

Fulkerson, D.R. and G.C. Harding, 1977. Maximizing the minimum source-sink path subject to a budget constraint. Math. Programming, 13: 116-118.
CrossRef  |  Direct Link  |  

Garey, M.R. and D.S. Johnson, 1979. Computers and Intractability A Guide to the Theory of NP Completeness. W.H. Freeman and Compan, UK.

Simaan, M. and J.B. Cruz Jr., 1973. On the Stackelberg strategy in nonzero-sum games. J. Optm.Theory Appl., 11: 533-555.
CrossRef  |  Direct Link  |  

Wollmer, R.D., 1970. Algorithms for targeting strikes in a lines-of-communication network. Oper. Res., 18: 497-515.
Direct Link  |  

Wood, R.K., 1993. Deterministic network interdiction. Math. Comput. Mod., 17: 1-18.
CrossRef  |  Direct Link  |