A Backward Sampling Framework for Interdiction Problems with Fortification

References

• Bard JF, Moore JT (1992) An algorithm for the discrete bilevel programming problem. Naval Res. Logist. 39(3):419–435.Crossref, Google Scholar
• Bayrak H, Bailey MD (2008) Shortest path network interdiction with asymmetric information. Networks 52(3):133–140.Crossref, Google Scholar
• Belvaux G, Wolsey LA (2000) bc–prod: A specialized branch-and-cut system for lot-sizing problems. Management Sci. 46(5):724–738.Link, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Management Sci. 28(10):1174–1186.Link, Google Scholar
• Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. Eur. J. Oper. Res. 168(1):1–16.Crossref, Google Scholar
• Brown G, Carlyle M, Salmerón J, Wood K (2006) Defending critical infrastructure. Interfaces 36(6):530–544.Link, Google Scholar
• Brown G, Carlyle M, Diehl D, Kline J, Wood K (2005a) A two-sided optimization for theater ballistic missile defense. Oper. Res. 53(5):745–763.Link, Google Scholar
• Brown GG, Carlyle WM, Salmerón J, Wood RK (2005b) Analyzing the vulnerability of critical infrastructure to attack and planning defenses. Greenberg HJ, Smith JC, eds. Tutorials in Operations Research: Emerging Theory, Methods, and Applications (INFORMS, Hanover, MD), 102–123.Link, Google Scholar
• Brown GG, Carlyle WM, Harney RC, Skroch EM, Wood RK (2009) Interdicting a nuclear-weapons project. Oper. Res. 57(4):866–877.Link, Google Scholar
• Cappanera P, Scaparra MP (2011) Optimal allocation of protective resources in shortest-path networks. Transportation Sci. 45(1):64–80.Link, Google Scholar
• Carøe CC, Tind J (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Programming 83(1):451–464.Crossref, Google Scholar
• Church RL, Scaparra MP (2007) The r-interdiction median problem with fortification. Geographical Anal. 39(2):129–146.Crossref, Google Scholar
• Church RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: The median and covering facility interdiction problems. Ann. Assoc. Amer. Geographers 94(3):491–502.Crossref, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Cormican KJ, Morton DP, Wood RK (1998) Stochastic network interdiction. Oper. Res. 46(2):184–197.Link, Google Scholar
• Dempe S (2002) Foundations of Bilevel Programming (Kluwer Academic Publishers, Boston).Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271.Crossref, Google Scholar
• Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6):832–848.Link, Google Scholar
• Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Management Sci. 26(7):669–679.Link, Google Scholar
• Fulkerson DR, Harding GC (1977) Maximizing minimum source-sink path subject to a budget constraint. Math. Programming 13(1):116–118.Crossref, Google Scholar
• Golden B (1978) A problem in network interdiction. Naval Res. Logist. Quart. 25(4):711–713.Crossref, Google Scholar
• Held H, Woodruff DL (2005) Heuristics for multi-stage interdiction of stochastic networks. J. Heuristics 11(6):483–500.Crossref, Google Scholar
• Held H, Hemmecke R, Woodruff DL (2005) A decomposition algorithm applied to planning the interdiction of stochastic networks. Naval Res. Logist. 52(4):321–328.Crossref, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: A review of models and algorithms. Omega 31(5):365–378.Crossref, Google Scholar
• Karmarkar US, Kekre S, Kekre S (1987) The dynamic lot-sizing problem with startup and reservation costs. Oper. Res. 35(3):389–398.Link, Google Scholar
• Lim C, Smith JC (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans. 39(1):15–26.Crossref, Google Scholar
• Lozano L, Medaglia AL (2013) On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1):378–384.Crossref, Google Scholar
• Moore JT, Bard JF (1990) The mixed integer linear bilevel programming problem. Oper. Res. 38(5):911–921.Link, Google Scholar
• Morton DP, Pan F, Saeger KJ (2007) Models for nuclear smuggling interdiction. IIE Trans. 39(1):3–14.Crossref, Google Scholar
• Pan F, Charlton W, Morton DP (2003) Interdicting smuggled nuclear material. Woodruff DL, ed. Network Interdiction and Stochastic Integer Programming (Kluwer Academic Publishers, Boston),1–20.Crossref, Google Scholar
• Peterson R, Silver EA (1979) Decision Systems for Inventory Management and Production Planning (Wiley, New York).Google Scholar
• Prince M, Smith JC, Geunes J (2013) A three-stage procurement optimization problem under uncertainty. Naval Res. Logist. 60(1):395–412.Crossref, Google Scholar
• Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4):1299–1331.Crossref, Google Scholar
• Royset JO, Wood RK (2007) Solving the bi-objective maximum-flow network-interdiction problem. INFORMS J. Comput. 19(2):175–184.Link, Google Scholar
• Salmerón J, Wood K, Baldick R (2004) Analysis of electric grid security under terrorist threat. IEEE Trans. Power Systems 19(2):905–912.Crossref, Google Scholar
• Salmerón J, Wood K, Baldick R (2009) Worst-case interdiction analysis of large-scale electric power grids. IEEE Trans. Power Systems 24(1):96–104.Crossref, Google Scholar
• Scaparra MP, Church RL (2008a) A bilevel mixed-integer program for critical infrastructure protection planning. Comput. Oper. Res. 35(6):1905–1923.Crossref, Google Scholar
• Scaparra MP, Church RL (2008b) An exact solution approach for the interdiction median problem with fortification. Eur. J. Oper. Res. 189(1):76–92.Crossref, Google Scholar
• Sen S, Sherali HD (2006) Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Programming 106(2):203–223.Crossref, Google Scholar
• Smith JC (2010) Basic interdiction models. Cochran J, ed. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Hoboken, NJ), 323–330.Google Scholar
• Smith JC, Lim C (2008) Algorithms for network interdiction and fortification games. Migdalas A, Pardalos PM, Pitsoulis L, Chinchuluun A, eds. Pareto Optimality, Game Theory and Equilibria, Nonconvex Optimization and Its Applications Series (Springer, New York), 609–644.Crossref, Google Scholar
• Smith JC, Lim C, Sudargho F (2007) Survivable network design under optimal and heuristic interdiction scenarios. J. Global Optim. 38(2):181–199.Crossref, Google Scholar
• Tang Y, Richard J-PP, Smith JC (2016) A class of algorithms for mixed-integer bilevel min–max optimization. J. Global Optim. 66(2):225–262.Crossref, Google Scholar
• Vicente L, Savard G, Judice J (1996) Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3):597–614.Crossref, Google Scholar
• Washburn R, Wood K (1995) Two-person zero-sum games for network interdiction. Oper. Res. 43(2):243–251.Link, Google Scholar
• Wollmer R (1964) Removing arcs from a network. Oper. Res. 12(6):934–940.Link, Google Scholar
• Wood RK (1993) Deterministic network interdiction. Math. Comput. Model. 17(2):1–18.Crossref, Google Scholar