A survey of network interdiction models and algorithms
暂无分享,去创建一个
[1] Nataliya I. Kalashnykova,et al. Bilevel Programming Problems , 2015 .
[2] Oktay Günlük,et al. Mixing mixed-integer inequalities , 2001, Math. Program..
[3] Yevgeniy Vorobeychik,et al. Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical Environments , 2016, GameSec.
[4] Alexander Mitsos,et al. Global solution of nonlinear mixed-integer bilevel programs , 2010, J. Glob. Optim..
[5] Jonathan Cole Smith,et al. Convex hull representation of the deterministic bipartite network interdiction problem , 2014, Math. Program..
[6] Hanif D. Sherali,et al. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts , 1980, Math. Program..
[7] Florian Dörfler,et al. Attack Detection and Identification in Cyber-Physical Systems -- Part II: Centralized and Distributed Monitor Design , 2012, ArXiv.
[8] Daniel Kuhn,et al. Interdiction Games on Markovian PERT Networks , 2015, Manag. Sci..
[9] J. Salmeron,et al. Worst-Case Interdiction Analysis of Large-Scale Electric Power Grids , 2009, IEEE Transactions on Power Systems.
[10] Matteo Fischetti,et al. Interdiction Games and Monotonicity, with Application to Knapsack Problems , 2019, INFORMS J. Comput..
[11] Shanchieh Jay Yang,et al. Segmenting Large-Scale Cyber Attacks for Online Behavior Model Generation , 2014, SBP.
[12] Jonathan Cole Smith,et al. A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem , 2017, Oper. Res..
[13] Ted K. Ralphs,et al. A Branch-and-cut Algorithm for Integer Bilevel Linear Programs , 2009 .
[14] Gerhard J. Woeginger,et al. Bilevel Knapsack with Interdiction Constraints , 2016, INFORMS J. Comput..
[15] David P. Morton,et al. Stochastic Network Interdiction , 1998, Oper. Res..
[16] Eduardo L. Pasiliao,et al. Minimum vertex blocker clique problem , 2014, Networks.
[17] Xiao Lei,et al. Stochastic maximum flow interdiction problems under heterogeneous risk preferences , 2018, Comput. Oper. Res..
[18] Marianthi G. Ierapetritou,et al. Resolution method for mixed integer bi-level linear problems based on decomposition technique , 2009, J. Glob. Optim..
[19] Johannes O. Royset,et al. Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem , 2007, INFORMS J. Comput..
[20] Javier Salmerón,et al. Deception tactics for network interdiction: A multiobjective approach , 2012, Networks.
[21] Noam Goldberg. Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks , 2017 .
[22] Claudio M. Rocco Sanseverino,et al. Bi and tri-objective optimization in the deterministic network interdiction problem , 2010, Reliab. Eng. Syst. Saf..
[23] Jay Lee,et al. Smart Agents in Industrial Cyber–Physical Systems , 2016, Proceedings of the IEEE.
[24] D. Morton,et al. Minimizing a stochastic maximum-reliability path , 2008 .
[25] Daniel Kuhn,et al. Data-driven inverse optimization with imperfect information , 2015, Mathematical Programming.
[26] Kelly M. Sullivan,et al. Securing a border under asymmetric information , 2014 .
[27] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..
[28] Rico Zenklusen,et al. Matching interdiction , 2008, Discret. Appl. Math..
[29] Abdullah Abusorrah,et al. Minimax-Regret Robust Defensive Strategy Against False Data Injection Attacks , 2019, IEEE Transactions on Smart Grid.
[30] Melvyn Sim,et al. The Price of Robustness , 2004, Oper. Res..
[31] J. Cole Smith,et al. Introduction To Robust Optimization , 2011 .
[32] D. R. Fulkerson,et al. On the Max Flow Min Cut Theorem of Networks. , 1955 .
[33] Cynthia A. Phillips,et al. The network inhibition problem , 1993, STOC.
[34] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[35] K. Nguyen. Reverse 1-center problem on weighted trees , 2016 .
[36] Andrew C. Trapp,et al. Overcoming human trafficking via operations research and analytics: Opportunities for methods, models, and applications , 2017, Eur. J. Oper. Res..
[37] Jonathan Cole Smith,et al. Survivable network design under optimal and heuristic interdiction scenarios , 2007, J. Glob. Optim..
[38] Cristina Comaniciu,et al. A Bayesian game approach for intrusion detection in wireless ad hoc networks , 2006, GameNets '06.
[39] Antonio J. Conejo,et al. An Efficient Tri-Level Optimization Model for Electric Grid Defense Planning , 2017, IEEE Transactions on Power Systems.
[40] Gerald G. Brown,et al. Interdicting a Nuclear-Weapons Project , 2009, Oper. Res..
[41] Chase Rainwater,et al. Interdicting layered physical and information flow networks , 2018 .
[42] Laura A. McLay,et al. Interdicting nuclear material on cargo containers using knapsack problem models , 2011, Ann. Oper. Res..
[43] Özlem Ergun,et al. The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability , 2010, Oper. Res. Lett..
[44] Jeff T. Linderoth,et al. Reformulation and sampling to solve a stochastic network interdiction problem , 2008 .
[45] R. Kevin Wood,et al. Deterministic network interdiction , 1993 .
[46] Sanjeeb Dash,et al. Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse , 2017, INFORMS J. Comput..
[47] Tamer Basar,et al. Dynamic Games in Cyber-Physical Security: An Overview , 2019, Dyn. Games Appl..
[48] Erick Delage,et al. Robust Multistage Decision Making , 2015 .
[49] Claudio M. Rocco Sanseverino,et al. A bi-objective approach for shortest-path network interdiction , 2010, Comput. Ind. Eng..
[50] H. Vincent Poor,et al. Infrastructure security games , 2014, Eur. J. Oper. Res..
[51] S. Lubore,et al. Finding the N most vital links in flow networks , 2011 .
[52] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[53] R. Aumann. UTILITY THEORY WITHOUT THE COMPLETENESS AXIOM , 1962 .
[54] Brigitte Jaumard,et al. Concavity cuts for disjoint bilinear programming , 2001, Math. Program..
[55] G. Nemhauser,et al. The mixed vertex packing problem , 2000 .
[56] Bo Zeng,et al. Vulnerability Analysis of Power Grids With Line Switching , 2013, IEEE Transactions on Power Systems.
[57] Ravindra K. Ahuja,et al. Inverse Optimization , 2001, Oper. Res..
[58] W. C. Turner,et al. Optimal interdiction policy for a flow network , 1971 .
[59] David A. Castañón,et al. Dynamic network interdiction games with imperfect information and deception , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[60] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[61] Heinrich von Stackelberg,et al. Stackelberg (Heinrich von) - The Theory of the Market Economy, translated from the German and with an introduction by Alan T. PEACOCK. , 1953 .
[62] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[63] David P. Morton,et al. Models for nuclear smuggling interdiction , 2007 .
[64] N. Assimakopoulos,et al. A network interdiction model for hospital infection control. , 1987, Computers in biology and medicine.
[65] Oleg A. Prokopyev,et al. Sequential Shortest Path Interdiction with Incomplete Information , 2016, Decis. Anal..
[66] R. Wets,et al. Stochastic programming , 1989 .
[67] Wei Yuan,et al. Robust Optimization-Based Resilient Distribution Network Planning Against Natural Disasters , 2016, IEEE Transactions on Smart Grid.
[68] David P. Morton,et al. Restricted-Recourse Bounds for Stochastic Linear Programming , 1999, Oper. Res..
[69] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[70] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[71] J. C. Smith,et al. Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .
[72] Delbert Ray Fulkerson,et al. Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..
[73] Alan W. McMasters,et al. Optimal interdiction of a supply network , 1970 .
[74] Matthew D. Bailey,et al. Shortest path network interdiction with asymmetric information , 2008 .
[75] Long Zhao,et al. Solving two-stage robust optimization problems using a column-and-constraint generation method , 2013, Oper. Res. Lett..
[76] Gerald G. Brown,et al. Defending Critical Infrastructure , 2006, Interfaces.
[77] James R. Luedtke,et al. New solution approaches for the maximum-reliability stochastic network interdiction problem , 2018, Comput. Manag. Sci..
[78] Zuo-Jun Max Shen,et al. Inverse Optimization with Noisy Data , 2015, Oper. Res..
[79] Richard D. Wollmer,et al. Removing Arcs from a Network , 1964 .
[80] Richard L. Church,et al. Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems , 2004 .
[81] Wei Yuan,et al. Optimal power grid protection through a defender-attacker-defender model , 2014, Reliab. Eng. Syst. Saf..
[82] Jonathan Cole Smith,et al. A class of algorithms for mixed-integer bilevel min–max optimization , 2015, Journal of Global Optimization.
[83] Chase Rainwater,et al. Multi-period network interdiction problems with applications to city-level drug enforcement , 2012 .
[84] Vicki M. Bier,et al. Balancing Terrorism and Natural Disasters - Defensive Strategy with Endogenous Attacker Effort , 2007, Oper. Res..
[85] R. Powell. Defending against Terrorist Attacks with Limited Resources , 2007, American Political Science Review.
[86] Jorge A. Sefair,et al. Exact algorithms and bounds for the dynamic assignment interdiction problem , 2017 .
[87] T. E. Harris,et al. Fundamentals of a Method for Evaluating Rail Net Capacities , 1955 .
[88] D. Bertsimas,et al. Robust and Data-Driven Optimization: Modern Decision-Making Under Uncertainty , 2006 .
[89] Alper Atamtürk,et al. Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction , 2017, INFORMS J. Comput..
[90] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[91] R. Vohra,et al. Finding the most vital arcs in a network , 1989 .
[92] J. Cole Smith,et al. Dynamic shortest‐path interdiction , 2016, Networks.
[93] Siqian Shen,et al. Risk-Averse Shortest Path Interdiction , 2016, INFORMS J. Comput..
[94] Churlzu Lim,et al. New product introduction against a predator: A bilevel mixed‐integer programming approach , 2009 .
[95] Jun Zhuang,et al. Modeling a Multitarget Attacker-Defender Game with Budget Constraints , 2017, Decis. Anal..
[96] R. Kevin Wood,et al. Shortest‐path network interdiction , 2002, Networks.
[97] Zuyi Li,et al. Modeling Load Redistribution Attacks in Power Systems , 2011, IEEE Transactions on Smart Grid.
[98] Pan Xu,et al. An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions , 2014, Comput. Oper. Res..
[99] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[100] Jason R. W. Merrick,et al. Stochastic network interdiction with incomplete preference , 2018, Networks.
[101] B. Golden. A problem in network interdiction , 1978 .