Mitigating Interdiction Risk with Fortification

References

• Alderson DL, Brown GG, Carlyle WM, Wood RK (2011) Solving defender-attacker-defender models for infrastructure defense. Wood RK, Dell RF, eds. Proc. 12th INFORMS Comput. Soc. Conf. Res. Comput. Homeland Defense (INFORMS, Catonsville, MD), 28–49.Google Scholar
• Ali I, Barnett D, Farhangian K, Kennington J, Patty B, Shetty B, McCarl B, Wong P (1984) Multicommodity network problems: Applications and computations. IIE Trans. 16(2):127–134.Crossref, Google Scholar
• Baghalian A, Rezapour S, Farahani RZ (2013) Robust supply chain network design with service level against disruptions and demand uncertainties: A real-life case. Eur. J. Oper. Res. 227(1):199–215.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 GG, Carlyle WM, Salmerón J, Wood K (2005) Analyzing the vulnerability of critical infrastructure to attack and planning defenses. Emerging Theory, Methods, and Applications, TutORials in Operations Research (INFORMS, Catonsville, MD), 102–123.Link, Google Scholar
• Carr RD, Greenberg HJ, Hart WE, Konjevod G, Lauer E, Lin H, Morrison T, Phillips CA (2006) Robust optimization of contaminant sensor placement for community water systems. Math. Programming 107(1):337–356.Crossref, Google Scholar
• Corley JHW, Chang H (1974) Finding the n most vital nodes in a flow network. Management Sci. 21(3):362–364.Link, Google Scholar
• Folie M, Tiffin J (1976) Solution of a multi-product manufacturing and distribution problem. Management Sci. 23(3):286–296.Link, Google Scholar
• Fulkerson D, Harding GC (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math. Programming 13(1):116–118.Crossref, Google Scholar
• Gendreau M, Laporte G, Parent I (2000) Heuristics for the location of inspection stations on a network. Naval Res. Logist. 47(4):287–303.Crossref, Google Scholar
• Gendron B, Crainic TG, Frangioni A (1999) Multicommodity capacitated network design. Sansò B, Soriano P, eds. Telecommunications Network Planning (Springer, Boston), 1–19.Crossref, Google Scholar
• Geoffrion AM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Management Sci. 20(5):822–844.Link, Google Scholar
• Hodgson MJ, Rosing KE, Zhang J (1996) Locating vehicle inspection stations to protect a transportation network. Geographical Anal. 28(4):299–314.Crossref, Google Scholar
• James J, Salhi S (2002) A tabu search heuristic for the location of multi-type protection devices on electrical supply tree networks. J. Combin. Optim. 6(1):81–98.Crossref, Google Scholar
• Laporte G, Louveaux FV, van Hamme L (1994) Exact solution to a location problem with stochastic demands. Transportation Sci. 28(2):95–103.Link, Google Scholar
• Liberatore F, Scaparra MP, Daskin MS (2011) Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification. Comput. Oper. Res. 38(1):357–366.Crossref, Google Scholar
• McCormick G (1976) Computability of global solutions to factorable nonconvex programs: Part I—Convex underestimating problems. Math. Programming 10(1):147–175.Crossref, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Neumann JV, Morgenstern O (2007) Theory of Games and Economic Behavior (Commemorative Edition) (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Olinick EV, Rosenberger JM (2008) Optimizing revenue in CDMA networks under demand uncertainty. Eur. J. Oper. Res. 186(2):812–825.Crossref, Google Scholar
• Orlowski S, Pióro M, Tomaszewski A, Wessäly R (2010) SNDlib 1.0—Survivable Network Design Library. Networks 55(3):276–286.Google Scholar
• Riis M, Andersen KA (2002) Capacitated network design with uncertain demand. INFORMS J. Comput. 14(3):247–260.Link, Google Scholar
• Salmeron 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
• Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1):96–115.Crossref, Google Scholar
• Scaparra MP, Cappanera P (2005) Optimizing security investments in transportation and telecommunication networks. INFORMS Annual Meeting, San Francisco.Google Scholar
• Scaparra MP, Church RL (2008) An exact solution approach for the interdiction median problem with fortification. Eur. J. Oper. Res. 189(1):76–92.Crossref, Google Scholar
• Scaparra MP, Church RL (2012) Protecting supply systems to mitigate potential disaster: A model to fortify capacitated facilities. Internat. Regional Sci. Rev. 35(2):188–210.Crossref, Google Scholar
• Sen S, Doverspike RD, Cosares S (1994) Network planning with random demand. Telecomm. Systems 3(1):11–30.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2014) Lectures on Stochastic Programming: Modeling and Theory, 2nd ed. (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Snyder LV, Scaparra MP, Daskin MS, Church RL (2006) Planning for disruptions in supply chain networks. Models, Methods, and Applications for Innovative Decision Making, TutORials in Operations Research (INFORMS, Catonsville, MD), 234–257.Google Scholar
• Terblanche S, Wessäly R, Hattingh J (2011) Survivable network design with demand uncertainty. Eur. J. Oper. Res. 210(1):10–26.Crossref, Google Scholar
• Washburn A, 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