Pages that link to "Item:Q3389526"
From MaRDI portal
The following pages link to Approximation algorithm for maximum flow network interdiction problem (Q3389526):
Displaying 11 items.
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- A maximum flow problem with intermediate node requirements (Q801796) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- Solving the bi-objective maximum-flow network-interdiction problem (Q2892322) (← links)
- (Q3538737) (← links)
- NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM (Q3982631) (← links)
- Approximation Algorithms for the Maximum Concurrent Flow Problem (Q4019972) (← links)
- Hardness and approximation for network flow interdiction (Q4638580) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow (Q5746246) (← links)