Risk-Averse Shortest Path Interdiction

References

• Ahmed S, Shapiro A (2008) Solving chance-constrained stochastic programs via sampling and integer programming. Chen L, Raghavan S, eds. TutORials in Operations Research: State-of-the-Art Decision-Making Tools in the Information-Intensive Age (INFORMS, Baltimore), 261–268.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Alderson DL, Brown GG, Carlyle WM (2014) Assessing and improving operational resilience of critical infrastructures and other systems. Newman A, Leung J, eds. TutORials in Operations Research: Bridging Data and Decision (INFORMS, Baltimore), 180–215.Link, Google Scholar
• Atamtürk A (2004) Sequence independent lifting for mixed-integer programming. Oper. Res. 52:487–490.Link, Google Scholar
• Bar-Gera H (2009) Transportation test problems. Accessed November 2015, http://www.bgu.ac.il/∼bargera/tntp/.Google Scholar
• Beigy H, Meybodi M (2006) Utilizing distributed learning automata to solve stochastic shortest path problems. Internat. J. Uncertainty, Fuzziness Knowledge-Based Systems 14(5):591–615.Crossref, Google Scholar
• Collado R (2012) Stochastic network interdiction. RUTCOR Technical report RRR 5-2012, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJ.Google Scholar
• Cormican KJ, Morton DP, Wood RK (1998) Stochastic network interdiction. Oper. Res. 46(2):184–197.Link, Google Scholar
• Dimitrov NB, Morton DP (2013) Interdiction models and applications. Herrmann J, ed. Handbook of Operations Research for Homeland Security (Springer, New York), 73–103.Crossref, Google Scholar
• Frank H (1969) Shortest paths in probabilistic graphs. Oper. Res. 17(4):583–599.Link, Google Scholar
• Golden B (1978) A problem in network interdiction. Naval Res. Logist. Quart. 25:711–713.Crossref, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1998) Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS J. Comput. 10(4):427–437.Link, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1999) Lifted cover inequalities for 0-1 integer programs: Complexity. INFORMS J. Comput. 11(1):117–123.Link, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (2000) Sequence independent lifting in mixed integer programming. J. Combinatorial Optim. 4(1):109–129.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
• Hemmecke R, Schultz R, Woodruff DL (2002) Interdicting stochastic networks. Woodruff DL, ed. Network Interdiction and Stochastic Integer Programming (Kluwer Academic Publishers, Boston), 71–80.Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Janjarassuk U, Linderoth JT (2008) Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3):120–132.Crossref, Google Scholar
• Küçükyavuz S (2012) On mixing sets arising in chance-constrained programming. Math. Programming 132(1):31–56.Crossref, Google Scholar
• LEMON (2009) LEMON—Library for Efficient Modeling and Optimization in Networks. Accessed November 2015, http://lemon.cs.elte.hu/.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
• Luedtke J (2014) A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Programming 146(1–2):219–244.Crossref, Google Scholar
• Luedtke J, Ahmed S, Nemhauser GL (2010) An integer programming approach for linear programs with probabilistic constraints. Math. Programming 122(2):247–272.Crossref, Google Scholar
• Martin JJ (1965) Distribution of the time through a directed, acyclic network. Oper. Res. 13(1):46–66.Link, Google Scholar
• Miller-Hooks E (2001) Adaptive least-expected time paths in stochastic, time-varying transportation and data networks. Networks 37(1):35–52.Crossref, Google Scholar
• Morton DP (2010) Stochastic network interdiction. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ), 1–15.Google Scholar
• Morton DP, Pan F, Saeger KJ (2007) Models for nuclear smuggling interdiction. IIE Trans. 39:3–14.Crossref, Google Scholar
• Murray AT, Matisziw TC, Grubesic TH (2007) Critical network infrastructure analysis: Interdiction and system flow. J. Geographical Systems 9(2):103–117.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Google Scholar
• Padberg MW (1975) A note on zero-one programming. Oper. Res. 23(4):833–837.Link, Google Scholar
• Pan F, Charlton DS, Morton DP, Smith JC (2007) Interdicting nuclear smuggling on a bipartite network. Technical report, Department of Mechanical Engineering, The University of Texas, Austin.Google Scholar
• Polychronopoulos GH, Tsitsiklis JN (1996) Stochastic shortest path problems with recourse. Networks 27(2):133–143.Crossref, Google Scholar
• Schrijver A (2002) On the history of the transportation and maximum flow problems. Math. Programming 91(3):437–445.Crossref, Google Scholar
• Shen S (2011) Reformulation and cutting-plane approaches for solving two-stage optimization and network interdiction problems. Unpublished doctoral thesis, University of Florida, Gainesville, FL.Google Scholar
• Smith JC, Lim C, Alptekinoglu A (2009) Optimal mixed-integer programming and heuristic methods for a bilevel Stackelberg product introduction game. Naval Res. Logist. 56(8):714–729.Crossref, Google Scholar
• Song Y, Luedtke J (2013) Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Programming Comput. 5:397–432.Crossref, Google Scholar
• Song Y, Zhang M (2015) Chance-constrained multi-terminal network design problems. Naval Res. Logist. 62(4):321–334.Crossref, Google Scholar
• Song Y, Luedtke JR, Küçükyavuz S (2014) Chance-constrained binary packing problems. INFORMS J. Comput. 26(4):735–747.Link, Google Scholar
• Waller T, Ziliaskopoulos AK (2002) On the online shortest path problem with limited arc cost dependencies. Networks 40(4):216–227.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 (2011) Bilevel network interdiction models: Formulations and solutions. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ), 1–11.Crossref, Google Scholar
• Woodruff DL (2003) Network Interdiction and Stochastic Integer Programming (Springer, New York).Crossref, Google Scholar