Approximation algorithm for maximum flow network interdiction problem
From MaRDI portal
Publication:3389526
Recommendations
- Hardness and approximation for network flow interdiction
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Solving the bi-objective maximum-flow network-interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- The multi-terminal maximum-flow network-interdiction problem
Cited in
(13)- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- scientific article; zbMATH DE number 5371757 (Why is no real title available?)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Hardness and approximation for network flow interdiction
- NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
- A maximum flow problem with intermediate node requirements
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- The multi-terminal maximum-flow network-interdiction problem
- Solving the bi-objective maximum-flow network-interdiction problem
- Approximation Algorithms for the Maximum Concurrent Flow Problem
This page was built for publication: Approximation algorithm for maximum flow network interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389526)