A problem in network interdiction
From MaRDI portal
Cited in
(46)- Interdicting the activities of a linear program -- a parametric analysis
- A bilevel programming model for proactive countermeasure selection in complex ICT systems
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Connectivity interdiction
- Finding the most vital arcs in a network
- The stochastic interdiction median problem with disruption intensity levels
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- The continuous maximum capacity path interdiction problem
- Network interdiction with asymmetric cost uncertainty
- Convex hull representation of the deterministic bipartite network interdiction problem
- A survey of network interdiction models and algorithms
- Solving multi-period interdiction via generalized Bender's decomposition
- An exact solution approach for the interdiction median problem with fortification
- Heuristics for multi-stage interdiction of stochastic networks
- Risk-averse shortest path interdiction
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- A brief overview of interdiction and robust optimization
- A class of algorithms for mixed-integer bilevel min-max optimization
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Deception tactics for network interdiction: a multiobjective approach
- Symmetric interdiction for matching problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction
- Analysis of budget for interdiction on multicommodity network flows
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Matching interdiction
- Vertex downgrading to minimize connectivity
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Shortest path interdiction problem with convex piecewise-linear costs
- A survey on mixed-integer programming techniques in bilevel optimization
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
- Attack and interception in networks
- Computation of Nash equilibria of attack and defense games on networks
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
- Edge downgrades in the maximal covering location problem
- The Maximal covering location disruption problem
- The quickest root-leaf interdiction problem on tree networks
- The multi-terminal maximum-flow network-interdiction problem
- On short paths interdiction problems: Total and node-wise limited interdiction
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
This page was built for publication: A problem in network interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177291)
