Shortest-Path Network Interdiction

Networks

Volumn 40, Issue 2, 2002, Pages 97-111

  Israeli, Eitan ^a   Wood, R Kevin ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

Benders decomposition; Bilevel program; Interdiction; Shortest paths

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING;

SHORTEST PATHS;

OPERATIONS RESEARCH;

EID: 0141764679     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10039     Document Type: Article

References (45)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. G. Anandalingam and V. Aprey, Multi-level programming and conflict resolution, Eur J Oper Res 51 (1991), 233-247.
3. A. Atamtürk, G.L. Nemhauser, and M.W.P. Savelsbergh, Conflict graphs in solving integer programming problems, Eur J Oper Res 121 (2000), 40-55.
4. E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J Appl Math 34 (1978), 119-148.
5. M.O. Ball, B.L. Golden, and R.V. Vohra, Finding the most vital arcs in a network, Oper Res Lett 8 (1989), 73-76.
6. J.F. Bard and J.T. Moore, A branch and bound algorithm for the bilevel programming problem, SIAM J Sci Stat Comput 11 (1990), 281-292.
7. J.F. Bard and J.T. Moore, An algorithm for the discrete bilevel programming problem, Naval Res Log 39 (1992), 419-435.
8. J.E. Beasley, A Lagrangian heuristic for set-covering problems, Naval Res Log 37 (1990), 151-164.
9. O. Ben-Ayed, Bilevel linear programming, Comput Oper Res 20 (1993), 485-501.
10. J.F. Benders, Partioning procedures for solving mixed integer variables programming problems, Num Math 4 (1962), 238-252.
11. T.H. Byers and M.S. Waterman, Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming, Oper Res 32 (1984), 1381-1384.
12. A. Caprara, M. Fischetti, and P. Toth, A heuristic algorithm for the set covering problem, Integer programming and combinatorial optimization, Lecture Notes on Computer Science 1084, W.H. Cunningham, S.T. McCormick, and M. Queyranne (Editors), Springer-Verlag, Berlin, 1996, pp. 72-81.
13. H.W. Corely and D.Y. Shaw, Most vital links and nodes in weighted networks, Oper Res Lett 1 (1982), 157-160.
14. K.J. Cormican, Computational methods for deterministic and stochastic network interdiction problems, Masters Thesis, Operations Research Department, Naval Postgraduate School, Monterey, CA, 1995.
15. K.J. Cormican, D.P. Morton, and R.K. Wood, Stochastic network interdiction, Oper Res 46 (1998), 184-197.
16. G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson, Solution of a large scale traveling salesman problem, Oper Res 2 (1954), 393-410.
17. J.E. Falk and K.R. Hoffman, A successive underestimation method for concave minimization problems, Math Oper Res 1 (1976), 251-259.
18. D.R. Fulkerson and G.C. Harding, Maximizing the minimum source-sink path subject to a budget constraint, Math Program 13 (1977), 116-118.
19. R.S. Garfinkel and G.L. Nemhauser, Integer programming, Wiley, New York, 1972.
20. A.M. Geoffrion and G.W. Graves, Multicommodity distribution system design by Benders decomposition, Mgmt Sci 20 (1974), 822-844.
21. P.M. Ghare, D.C. Montgomery, and T.M. Turner, Optimal interdiction policy for a flow network, Naval Res Log Q 18 (1971), 37-45.
22. B.L. Golden, A problem in network interdiction, Naval Res Log Q 25 (1978), 711-713.
23. M. Grötschel, C.L. Monma, and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Oper Res 40 (1992), 309-330.
24. P. Hansen, B. Jaumard, and G. Savard, New branch-and-bound rules for linear bi-level programming, SIAM J Sci Stat Comput 13 (1992), 1194-1217.
25. J.N. Hooker, Logic-based methods for optimization, Principles and practice of constraint programming, Lecture Notes in Computer Science 874, A. Borning (Editor), Springer-Verlag, Berlin, 1994, pp. 336-349.
26. ILOG 1999, ILOG CPLEX 6.5, Reference Manual, ILOG, S.A., France.
27. E. Israeli, System interdiction and defense, Ph.D. Dissertation, Operations Research Department, Naval Postgraduate School, Monterey, CA, 1999.
28. J.J. Judice and A.M. Faustino, A sequential LCP method for bilevel linear programming, Ann Oper Res 34 (1992), 89-106.
29. N. Katoh, T. Ibaraki, and H. Mine, An efficient algorithm for the k shortest simple paths, Networks 12 (1982), 411-427.
30. K. Malik, A.K. Mittal, and S.K. Gupta, The k most vital arcs in the shortest path problem, Oper Res Lett 8 (1989), 223-227.
31. A.W. McMasters and T.M. Mustin, Optimal interdiction of a supply network, Naval Res Log Q 17 (1970), 261-268.
32. D. Medhi, A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis, IEEE Trans Commun 42 (1994), 534-548.
33. J.T. Moore and J.F. Bard, The mixed integer linear bilevel programming problem, Oper Res 38 (1990), 911-921.
34. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
35. H. Önal, A modified simplex approach for solving bi-level programming problems, Eur J Oper Res 67 (1993), 126-135.
36. M. Padberg, A note on zero-one programming, Oper Res 23 (1975), 833-837.
37. M. Simaan and J.B. Cruz, On the Stackelberg strategy in nonzero-sum games, J Optim Theory Appl 11 (1973), 533-555.
38. H.A. Taha, Integer programming, Academic Press, New York, 1975.
39. H. Vaish and C.M. Shetty, A cutting plane algorithm for the bilinear programming problem, Naval Res Log Q 24 (1977), 83-94.
40. L. Vicente, G. Savard, and J. Judice, Discrete linear bi-level programming problem, J Optim Theory Appl 89 (1996), 597-614.
41. A. Washburn and K. Wood, Two-person zero-sum games for network interdiction, Oper Res 43 (1994), 243-251.
42. U.P. Wen and Y.H. Yang, Algorithms for solving the mixed integer two-level linear programming problem, Comput Oper Res 17 (1990), 133-142.
43. P.S. Whiteman, Improving single strike effectiveness for network interdiction, Mil Oper Res 4 (1999), 15-30.
44. L.A. Wolsey, Integer programming, Wiley, New York, 1998.
45. R.K. Wood, Deterministic network interdiction, Math Comput Mod 17(1993), 1-18.