Deception tactics for network interdiction: A multiobjective approach
From MaRDI portal
Publication:4648690
DOI10.1002/net.20458zbMath1251.90071MaRDI QIDQ4648690
Publication date: 15 November 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20458
asymmetric information; multiobjective optimization; Benders decomposition; bi-level optimization; network interdiction; generalized networks
90C29: Multi-objective and goal programming
90B10: Deterministic network models in operations research
Related Items
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback, Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set, The bi-objective critical node detection problem, A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover, Optimising the barrier coverage of a wireless sensor network with hub-and-spoke topology using mathematical and simulation models, Risk evaluation and games in mine warfare considering shipcounter effects, The minimal covering location and sizing problem in the presence of gradual cooperative coverage, Convex hull representation of the deterministic bipartite network interdiction problem, A survey of network interdiction models and algorithms
Cites Work
- Unnamed Item
- Game theoretic risk analysis of security threats
- Deterministic network interdiction
- Stochastic Network Interdiction
- Minimizing a stochastic maximum-reliability path
- Shortest path network interdiction with asymmetric information
- A problem in network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- A Two-Sided Optimization for Theater Ballistic Missile Defense