The following pages link to (Q4452913):
Displaying 18 items.
- Matching interdiction (Q602686) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
