scientific article; zbMATH DE number 2050722
From MaRDI portal
Publication:4452913
Recommendations
- Hardness and approximation for network flow interdiction
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Network flow interdiction on planar graphs
- Approximation algorithm for maximum flow network interdiction problem
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
Cited in
(21)- Protection of flows under targeted attacks
- Bilevel model for adaptive network flow problem
- Parametric multiroute flow and its application to multilink-attack network
- On the power of randomization in network interdiction
- Models and methods for solving the problem of network vulnerability
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Interdicting facilities in tree networks
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Removing undesirable flows by edge deletion
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Approximation Algorithms for k-Hurdle Problems
- 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
- Approximation algorithms for \(k\)-hurdle problems
- A (B + 1)-approximation for network flow interdiction with unit costs
- Approximation algorithms for two extensions of min-k-union
- On extensions of min-k-union
- Interdiction problems on planar graphs
- Network flow interdiction on planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452913)
