Exact algorithms for solving a Euclidean maximum flow network interdiction problem

DOI10.1002/net.21561zbMath1387.90294OpenAlexW2066645961MaRDI QIDQ4642473

J. Cole Smith, Kelly M. Sullivan

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 programmingEuclidean spacebilevel optimizationnetwork interdictionspace-discretization

Mathematics Subject Classification ID

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

Related Items (7)

An integrated approach to redundancy allocation and test planning for reliability growth ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

This page was built for publication: Exact algorithms for solving a Euclidean maximum flow network interdiction problem