Sequential Shortest Path Interdiction with Incomplete Information

References

• Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2–3):235–256.Crossref, Google Scholar
• Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (2003) The non-stochastic multi-armed bandit problem. SIAM J. Comput. 32(1):48–77.Crossref, Google Scholar
• Awerbuch B, Kleinberg RD (2004) Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. Babai L, ed. Proc. Thirty-Sixth Ann. ACM Sympos. Theory Comput. STOC ’04 (ACM, New York), 45–53.Crossref, Google Scholar
• Ball M, Golden B, Vohra R (1989) Finding the most vital arcs in a network. Oper. Res. Lett. 8(2):73–76.Crossref, Google Scholar
• Bayrak H, Bailey M (2008) Shortest path network interdiction with asymmetric information. Networks 52(3):133–140.Crossref, Google Scholar
• Beheshti B, Özaltın OY, Zare MH, Prokopyev OA (2015) Exact solution approach for a class of nonlinear bilevel knapsack problems. J. Global Optim. 61(2):291–310.Crossref, Google Scholar
• Brown G, Carlyle M, Salmerón J, Wood R (2006) Defending critical infrastructure. Interfaces 36(6):530–544.Link, Google Scholar
• Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Cesa-Bianchi N, Lugosi G (2012) Combinatorial bandits. J. Comput. System Sci. 78(5):1404–1422.Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153(1):235–256.Crossref, Google Scholar
• Corley H, Chang H (1974) Finding the n most vital nodes in a flow network. Management Sci. 21(3):362–364.Link, Google Scholar
• Corley H, Sha D (1982) Most vital links and nodes in weighted networks. Oper. Res. Lett. 1(4):157–160.Crossref, Google Scholar
• Cormican K, Morton D, Wood R (1998) Stochastic network interdiction. Oper. Res. 46(2):184–197.Link, Google Scholar
• Erdős P, Rényi A (1959) On random graphs, I. Publicationes Mathematicae (Debrecen) 6:290–297.Google Scholar
• Fulkerson D, Harding G (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math. Programming 13(1):116–118.Crossref, Google Scholar
• Ghare P, Montgomery D, Turner W (1971) Optimal interdiction policy for a flow network. Naval Res. Logist. Quart. 18(1):37–45.Crossref, Google Scholar
• Gift PD (2010) Planning for an adaptive evader with application to drug interdiction operations. Unpublished doctoral thesis, Naval Postgraduate School, Monterey, CA.Google Scholar
• Granata D, Steeger G, Rebennack S (2013) Network interdiction via a critical disruption path: Branch-and-price algorithms. Comput. Oper. Res. 40(11):2689–2702.Crossref, Google Scholar
• Hausken K, Zhuang J (2011) Governments’ and terrorists’ defense and attack in a t-period game. Decision Anal. 8(1):46–70.Link, Google Scholar
• Hemmecke R, Schultz R, Woodruff D (2003) Interdicting stochastic networks with binary interdiction effort. Woodruff D, ed. Network Interdiction and Stochastic Integer Programming (Springer, Boston), 69–84.Crossref, Google Scholar
• Israeli E, Wood R (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Janjarassuk U, Linderoth J (2008) Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3):120–132.Crossref, Google Scholar
• Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4–22.Crossref, 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
• Malaviya A, Rainwater C, Sharkey T (2012) Multi-period network interdiction problems with applications to city-level drug enforcement. IIE Trans. 44(5):368–380.Crossref, Google Scholar
• Malik K, Mittal A, Gupta S (1989) The k-most vital arcs in the shortest path problem. Oper. Res. Lett. 8(4):223–227.Crossref, Google Scholar
• McLay L, Rothschild C, Guikema S (2012) Robust adversarial risk analysis: A level-k approach. Decision Anal. 9(1):41–54.Link, Google Scholar
• McMasters A, Mustin T (1970) Optimal interdiction of a supply network. Naval Res. Logist. Quart. 17(3):261–268.Crossref, Google Scholar
• Modaresi S, Saure D, Vielma J (2012) Learning in combinatorial optimization: What and how to explore. Working paper, Duke University, Durham, NC.Google Scholar
• Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Trans. 39(1):3–14.Crossref, Google Scholar
• Pan F, Morton D (2008) Minimizing a stochastic maximum-reliability path. Networks 52(3):111–119.Crossref, Google Scholar
• Ratliff H, Sicilia G, Lubore S (1975) Finding the n most vital links in flow networks. Management Sci. 21(5):531–539.Link, Google Scholar
• Robbins H (1952) Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. 58(5):527–535.Crossref, Google Scholar
• Shen S, Smith JC (2012) Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2):103–119.Crossref, Google Scholar
• Shen S, Smith JC, Goli R (2012) Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optim. 9(3):172–188.Crossref, Google Scholar
• Smith JC, Lim C (2008) Algorithms for network interdiction and fortification games. Pardalos PM, Migdalas A, Pitsoulis L, eds. Pareto Optimality, Game Theory Equilibria (Springer, New York), 609–644.Crossref, Google Scholar
• Veremyev A, Boginski V, Pasiliao EL (2014a) Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8(4):1245–1259.Crossref, Google Scholar
• Veremyev A, Prokopyev OA, Pasiliao EL (2014b) An integer programming framework for critical elements detection in graphs. J. Combinatorial Optim. 28(1):233–273.Crossref, Google Scholar
• Walteros JL, Pardalos PM (2012) Selected topics in critical element detection. Daras NJ, ed. Applications of Mathematics and Informatics in Military Science, Springer Optimization and Its Applications, Vol. 71 (Springer, New York), 9–26.Crossref, Google Scholar
• Washburn A, Wood R (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 R (1993) Deterministic network interdiction. Math. Comput. Modeling 17(2):1–18.Crossref, Google Scholar
• Xu J, Zhuang J (2014) Modeling costly learning and counter-learning in a defender-attacker game with private defender information. Ann. Oper. Res. Forthcoming.Google Scholar
• Zhuang J, Bier VM, Alagoz O (2010) Modeling secrecy and deception in a multiple-period attacker–defender signaling game. Eur. J. Oper. Res. 203(2):409–418.Crossref, Google Scholar