Exact algorithms for solving a Euclidean maximum flow network interdiction problem

DOI10.1002/NET.21561MaRDI QIDQ4642473zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

global optimizationinteger programmingbilevel optimizationEuclidean spacenetwork interdictionspace-discretization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• The multi-terminal maximum-flow network-interdiction problem
• Deterministic network interdiction
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
• Network flow interdiction on planar graphs
• Solving the bi-objective maximum-flow network-interdiction problem

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
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
• An iterative security game for computing robust and adaptive network flows
• 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)