Exact algorithms for solving a Euclidean maximum flow network interdiction problem
From MaRDI portal
Publication:4642473
DOI10.1002/NET.21561zbMATH Open1387.90294OpenAlexW2066645961MaRDI QIDQ4642473FDOQ4642473
Authors: Kelly M. Sullivan, J. Cole Smith 
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21561
Recommendations
global optimizationinteger programmingbilevel optimizationEuclidean spacenetwork interdictionspace-discretization
Cited In (14)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Solving the bi-objective maximum-flow network-interdiction problem
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- The multi-terminal maximum-flow network-interdiction problem
- The all-pairs vitality-maximization (VIMAX) problem
- Deterministic network interdiction
- An integrated approach to redundancy allocation and test planning for reliability growth
- An iterative security game for computing robust and adaptive network flows
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- An exact method for nonlinear network flow interdiction problems
- Two extended formulations for cardinality maximum flow network interdiction problem
- Analysis of budget for interdiction on multicommodity network flows
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
This page was built for publication: Exact algorithms for solving a Euclidean maximum flow network interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642473)
