Pages that link to "Item:Q4642473"
From MaRDI portal
The following pages link to Exact algorithms for solving a Euclidean maximum flow network interdiction problem (Q4642473):
Displaying 7 items.
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- An integrated approach to redundancy allocation and test planning for reliability growth (Q1651603) (← links)
- Designing networks with resiliency to edge failures using two-stage robust optimization (Q2315627) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
