Deterministic network interdiction
From MaRDI portal
Publication:1804095
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
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- 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
- 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
- Deception tactics for network interdiction: a multiobjective approach
- Symmetric interdiction for matching problems
- Radio communications interdiction problem under deterministic and probabilistic jamming
- On the power of randomization in network interdiction
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Optimal detection of critical nodes: improvements to model structure and performance
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- The continuous maximum capacity path interdiction problem
- A two‐stage network interdiction‐monitoring game
- Matrix interdiction problem
- Sequential interdiction with incomplete information and learning
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Equilibrium strategies for multiple interdictors on a common network
- Multilevel approaches for the critical node problem
- Minimum cost edge blocker clique problem
- Protection of flows under targeted attacks
- Critical edges for the assignment problem: complexity and exact resolution
- A bilevel exposure-oriented sensor location problem for border security
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- A unified framework for multistage mixed integer linear optimization
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction
- Interdiction problems on planar graphs
- A survey on mixed-integer programming techniques in bilevel optimization
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- On bilevel optimization with inexact follower
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- A survey of network interdiction models and algorithms
- The multi-terminal maximum-flow network-interdiction problem
- Detecting critical node structures on graphs: a mathematical programming approach
- Critical infrastructure protection using secrecy -- a discrete simultaneous game
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Bilevel model for adaptive network flow problem
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Sequential Shortest Path Interdiction with Incomplete Information
- Reliability problems in multiple path-shaped facility location on networks
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Wireless LAN transmitter location under the threat of jamming attacks
- Two extended formulations for cardinality maximum flow network interdiction problem
- Perfect matching interdiction problem restricted to a stable vertex
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Robust flows over time: models and complexity results
- Parametric multiroute flow and its application to multilink-attack network
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An interdiction game on a queueing network with multiple intruders
- Risk-averse stochastic path detection
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Blockers for the stability number and the chromatic number
- Interdicting facilities in tree networks
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- The stochastic interdiction median problem with disruption intensity levels
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Hybrid constructive heuristics for the critical node problem
- Approximation algorithms for \(k\)-hurdle problems
- An exact solution approach for the interdiction median problem with fortification
- A defensive maximal covering problem on a network
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- The critical node detection problem in networks: a survey
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- A dynamic reformulation heuristic for generalized interdiction problems
- An analytical approach to the protection planning of a rail intermodal terminal network
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
- The stochastic critical node problem over trees
- Network flow interdiction on planar graphs
- The \(q\)-ad hoc hub location problem for multi-modal networks
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Complexity of most vital nodes for independent set in graphs related to tree structures
- A bilevel mixed-integer program for critical infrastructure protection planning
- Nodal interdiction
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Connectivity interdiction
- Shortest path network interdiction with asymmetric information
- A dynamic network interdiction problem
- The most vital nodes with respect to independent set and vertex cover
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Minimizing a stochastic maximum-reliability path
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Designing robust coverage networks to hedge against worst-case facility losses
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A genetic algorithm for a class of critical node problems
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Network interdiction with asymmetric cost uncertainty
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Bi-objective optimization models for network interdiction
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- VNS solutions for the critical node problem
- Selected topics in critical element detection
- A simple greedy heuristic for linear assignment interdiction
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)
