Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback

References

• Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Audet C, Hansen P, Jaumard B, Savard G (1997) Links between linear bilevel and mixed 0-1 programming problems. J. Optim. Theory Appl. 93(2):273–300.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
• Bastert O, Matuszewski C (2001) Layered drawings of digraphs. Kaufmann M, Wagner D, eds. Drawing Graphs (Springer, Berlin), 87–120.Crossref, Google Scholar
• Bayrak H, Bailey M (2008) Shortest path network interdiction with asymmetric information. Networks 52(3):133–140.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1–3):49–71.Crossref, Google Scholar
• Borrero JS, Lozano L (2021) Modeling defender-attacker problems as robust linear programs with mixed-integer uncertainty sets. INFORMS J. Comput. , ePub ahead of print February 17, https://doi.org/10.1287/ijoc.2020.1041.Link, Google Scholar
• Borrero JS, Prokopyev OA, Sauré D (2016) Sequential shortest path interdiction with incomplete information. Decision Anal. 13(1):68–98.Link, Google Scholar
• Borrero JS, Prokopyev OA, Sauré D (2019) Sequential interdiction with incomplete information and learning. Oper. Res. 67(1):72–89.Link, Google Scholar
• Buchheim C, Kurtz J (2018) Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3):211–238.Crossref, Google Scholar
• Buehn A, Eichler S (2009) Smuggling illegal vs. legal goods across the U.S.‐Mexico border: A structural equations model approach. South. Econom. J. 76(2):328–350.Crossref, Google Scholar
• Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, Cambridge, UK).Crossref, 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
• Erdős P, Rényi A (1959) On random graphs, I. Publ. Math. 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
• Gathmann C (2008) Effects of enforcement on illegal markets: Evidence from migrant smuggling along the southwestern border. J. Public Econom. 92(10–11):1926–1941.Crossref, Google Scholar
• Gift PD (2010) Planning for an adaptive evader with application to drug interdiction operations. PhD thesis, Naval Postgraduate School, Monterey, CA.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
• Israeli E, Wood R (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Johnson MP, Gutfraind A, Ahmadizadeh K (2014) Evader interdiction: Algorithms, complexity and collateral damage. Ann. Oper. Res. 222(1):341–359.Crossref, Google Scholar
• Magliocca NR, McSweeney K, Sesnie SE, Tellman E, Devine JA, Nielsen EA, Pearson Z, Wrathall DJ (2019) Modeling cocaine traffickers and counterdrug interdiction forces as a complex adaptive system. Proc. Natl. Acad. Sci. USA 116(16):7784–7792.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
• Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Trans. 39(1):3–14.Crossref, Google Scholar
• Petrov VV (2007) On lower bounds for tail probabilities. J. Statist. Planning Inference 137(8):2703–2705.Crossref, Google Scholar
• Poss M (2013) Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1):75–92.Google Scholar
• Salmerón J (2012) Deception tactics for network interdiction: A multiobjective approach. Networks 60(1):45–58.Crossref, Google Scholar
• Sefair JA, Smith JC (2016) Dynamic shortest-path interdiction. Networks 68(4):315–330.Crossref, Google Scholar
• Shaked M, Shanthikumar JG (2007) Stochastic Orders (Springer Science & Business Media, New York).Crossref, Google Scholar
• Sinha A, Malo P, Deb K (2018) A review on bilevel optimization: From classical to evolutionary approaches and applications. IEEE Trans. Evolutionary Comput. 22(2):276–295.Crossref, Google Scholar
• Smith JC, Song Y (2020) A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3):797–811.Google Scholar
• Smith JC, Prince M, Geunes J (2013) Modern network interdiction problems and algorithms. Pardalos P, Du DZ, Graham R, eds. Handbook of Combinatorial Optimization (Springer, New York), 1949–1987.Crossref, Google Scholar
• Song Y, Shen S (2016) Risk-averse shortest path interdiction. INFORMS J. Comput. 28(3):527–539.Link, Google Scholar
• von Stengel B, Zamir S (2010) Leadership games with convex strategy sets. Games Econom. Behav. 69(2):446–457.Crossref, Google Scholar
• Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393(6684):440–442.Crossref, Google Scholar
• Xu J, Zhuang J (2016) Modeling costly learning and counter-learning in a defender-attacker game with private defender information. Ann. Oper. Res. 236(1):271–289.Crossref, Google Scholar
• Yu G, Yang J (1998) On the robust shortest path problem. Comput. Oper. Res. 25(6):457–468.Crossref, Google Scholar
• Yürekli A, Sayginsoy Ö (2010) Worldwide organized cigarette smuggling: An empirical analysis. Appl. Econom. 42(5):545–561.Crossref, Google Scholar
• Zare MH, Borrero JS, Zeng B, Prokopyev OA (2019) A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1):99–117.Crossref, Google Scholar
• Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.Crossref, Google Scholar
• Zheng J, Castañón DA (2012) Dynamic network interdiction games with imperfect information and deception. 2012 IEEE 51st IEEE Conf. Decision Control (IEEE, Piscataway, NJ), 7758–7763.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