Pages that link to "Item:Q987697"
From MaRDI portal
The following pages link to Network flow interdiction on planar graphs (Q987697):
Displaying 34 items.
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Matching interdiction (Q602686) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Vertex control of flows in networks (Q998848) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
- A study of network violator interception based on a reliable game model (Q1717694) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Perfect matching interdiction problem restricted to a stable vertex (Q1794725) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs (Q2050253) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Minimum \(d\)-transversals of maximum-weight stable sets in trees (Q2857332) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Hardness and approximation for network flow interdiction (Q4638580) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Bounds of spectral radii on edge-most outer-planar bipartite graphs (Q5300063) (← 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)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- The critical node game (Q6645160) (← links)