Algorithms for network interdiction and fortification games
From MaRDI portal
Recommendations
- A survey of network interdiction models and algorithms
- Mitigating interdiction risk with fortification
- A Backward Sampling Framework for Interdiction Problems with Fortification
- scientific article; zbMATH DE number 2050723
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
Cited in
(36)- Protection of flows under targeted attacks
- Solving the traveling salesman problem with interdiction and fortification
- Bilevel model for adaptive network flow problem
- Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- A study of general and security Stackelberg game formulations
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Equilibrium strategies for multiple interdictors on a common network
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- A survey of network interdiction models and algorithms
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- Survivable network design under optimal and heuristic interdiction scenarios
- Bilevel knapsack with interdiction constraints
- A brief overview of interdiction and robust optimization
- scientific article; zbMATH DE number 1754580 (Why is no real title available?)
- Sequential Shortest Path Interdiction with Incomplete Information
- Two-Person Zero-Sum Games for Network Interdiction
- Sequential interdiction with incomplete information and learning
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Mitigating interdiction risk with fortification
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Path-disruption games: bribery and a probabilistic model
- Bi-objective optimization models for network interdiction
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- A generic optimization framework for resilient systems
- On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
- Shortest path interdiction problem with convex piecewise-linear costs
- An exact method for binary fortification games
- Disconnectedness brings robustness? On network design for matching with vertex interdiction
- Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach
- Vehicle scheduling network interdiction problem with fortification: an application to cyber security planning
- Efficient algorithms for game-theoretic betweenness centrality
This page was built for publication: Algorithms for network interdiction and fortification games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528714)
