The multi-terminal maximum-flow network-interdiction problem
From MaRDI portal
Publication:713097
Recommendations
- Deterministic network interdiction
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- Solving the bi-objective maximum-flow network-interdiction problem
- Approximation algorithm for maximum flow network interdiction problem
Cites work
- A Two-Sided Optimization for Theater Ballistic Missile Defense
- A bilevel mixed-integer program for critical infrastructure protection planning
- A global optimization algorithm for reliable network design
- A problem in network interdiction
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Design of communication networks with survivability constraints
- Determining the most vital link in a flow network
- Deterministic network interdiction
- Foundations of bilevel programming
- Interception in a network
- Maximal Flow Through a Network
- Maximizing the minimum source-sink path subject to a budget constraint
- Minimal multicut and maximal integer multiflow: a survey
- Multi-level programming and conflict resolution
- Network flows. Theory, algorithms, and applications.
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- On the Stackelberg strategy in nonzero-sum games
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Removing Arcs from a Network
- Shortest-path network interdiction
- Stochastic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- The Complexity of Multiterminal Cuts
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(31)- The all-pairs vitality-maximization (VIMAX) problem
- An exact method for binary fortification games
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks
- The continuous maximum capacity path interdiction problem
- Deterministic network interdiction
- The multiroute maximum flow problem revisited
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Theoretical and computational advances for network diversion
- An exact method for nonlinear network flow interdiction problems
- Protection of flows under targeted attacks
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A multivariate analysis of the strict terminal connection problem
- A survey on mixed-integer programming techniques in bilevel optimization
- Resolving interferences of triple‐crossover‐cranes by determining paths in networks
- A maximum flow problem with intermediate node requirements
- 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
- Solving the bi-objective maximum-flow network-interdiction problem
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Approximation algorithm for maximum flow network interdiction problem
- Two extended formulations for cardinality maximum flow network interdiction problem
- Perfect matching interdiction problem restricted to a stable vertex
- Optimal \(K\)-node disruption on a node-capacitated network
- Analysis of budget for interdiction on multicommodity network flows
- Parametric multiroute flow and its application to multilink-attack network
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
This page was built for publication: The multi-terminal maximum-flow network-interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713097)
