scientific article; zbMATH DE number 2050722
zbMATH Open1051.90005MaRDI QIDQ4452913FDOQ4452913
Authors: Carl Burch, Robert D. Carr, Sven O. Krumke, Madhav V. Marathe, Cynthia Phillips, Eric Sundberg 
Publication date: 7 March 2004
Title of this publication is not available (Why is that?)
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
linear programminginteger programmingminimum cutmulticriteria optimizationpolynomial-time algorithminteger programlinear-programming relaxationnetwork inhibition problempseudoapproximation algorithm
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Integer programming (90C10) Stochastic network models in operations research (90B15)
Cited In (18)
- On the power of randomization in network interdiction
- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- Protection of flows under targeted attacks
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- Models and methods for solving the problem of network vulnerability
- Vertex downgrading to minimize connectivity
- Bilevel model for adaptive network flow problem
- Parametric multiroute flow and its application to multilink-attack network
- Interdicting facilities in tree networks
- Matching interdiction
- Network flow interdiction on planar graphs
- Interdiction problems on planar graphs
- Approximation Algorithms for k-Hurdle Problems
- Approximation algorithms for \(k\)-hurdle problems
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
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)
