Deterministic network interdiction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2050723
- The multi-terminal maximum-flow network-interdiction problem
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- A dynamic network interdiction problem
- Reformulation and sampling to solve a stochastic network interdiction problem
Cites work
- Determining the most vital link in a flow network
- Edmonds polytopes and a hierarchy of combinatorial problems
- Facets of the knapsack polytope
- Finding the n Most Vital Links in Flow Networks
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Removing Arcs from a Network
- Solving Large-Scale Zero-One Linear Programming Problems
Cited in
(only showing first 100 items - show all)- Exact algorithms for the minimum cost vertex blocker clique problem
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- The q-ad hoc hub location problem for multi-modal networks
- A bilevel exposure-oriented sensor location problem for border security
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Protection of flows under targeted attacks
- An adaptive robust framework for the optimization of the resilience of interdependent infrastructures under natural hazards
- Wireless LAN transmitter location under the threat of jamming attacks
- Radio communications interdiction problem under deterministic and probabilistic jamming
- Bilevel model for adaptive network flow problem
- The critical node detection problem in networks: a survey
- Parametric multiroute flow and its application to multilink-attack network
- An analytical approach to the protection planning of a rail intermodal terminal network
- Risk-averse stochastic path detection
- An interdiction game on a queueing network with multiple intruders
- A dynamic reformulation heuristic for generalized interdiction problems
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Robust flows over time: models and complexity results
- Connectivity interdiction
- On the power of randomization in network interdiction
- Perfect matching interdiction problem restricted to a stable vertex
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Complexity of determining the most vital elements for the p-median and p-center location problems
- The stochastic interdiction median problem with disruption intensity levels
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Optimal detection of critical nodes: improvements to model structure and performance
- Equilibrium strategies for multiple interdictors on a common network
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- The continuous maximum capacity path interdiction problem
- Probability estimation via policy restrictions, convexification, and approximate sampling
- Complexity of the multilevel critical node problem
- Interdicting facilities in tree networks
- Exact and approximation algorithms for sensor placement against DDoS attacks
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Network interdiction with asymmetric cost uncertainty
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The complexity of computing a robust flow
- A survey of network interdiction models and algorithms
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Optimal K-node disruption on a node-capacitated network
- Reliability problems in multiple path-shaped facility location on networks
- Solving multi-period interdiction via generalized Bender's decomposition
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Critical edges for the assignment problem: complexity and exact resolution
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- Jamming communication networks under complete uncertainty
- An exact solution approach for the interdiction median problem with fortification
- VNS solutions for the critical node problem
- An iterative security game for computing robust and adaptive network flows
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- The connected critical node problem
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach
- Hybrid constructive heuristics for the critical node problem
- Theoretical and computational advances for network diversion
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Infrastructure security games
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- Complexity of most vital nodes for independent set in graphs related to tree structures
- A dynamic network interdiction problem
- Minimizing a stochastic maximum-reliability path
- Shortest path network interdiction with asymmetric information
- Minimum edge blocker dominating set problem
- Optimizing dynamic investment decisions for railway systems protection
- A bilevel formulation of the pediatric vaccine pricing problem
- A genetic algorithm for a class of critical node problems
- A brief overview of interdiction and robust optimization
- A class of algorithms for mixed-integer bilevel min-max optimization
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
- Network interdiction via a critical disruption path: branch-and-price algorithms
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Protection issues for supply systems involving random attacks
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- Matrix interdiction problem
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- A defensive maximal covering problem on a network
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Nodal interdiction
- The most vital nodes with respect to independent set and vertex cover
- scientific article; zbMATH DE number 2050723 (Why is no real title available?)
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Detecting critical node structures on graphs: a mathematical programming approach
This page was built for publication: Deterministic network interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804095)
