Securing a border under asymmetric information

DOI10.1002/nav.21567zbMath1411.90345OpenAlexW1992713805MaRDI QIDQ4632821

David P. Morton, Feng Pan, J. Cole Smith, Kelly M. Sullivan

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21567

zbMATH Keywords

asymmetric informationcutting planesnetwork interdiction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (10)

Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ Integer programming methods for solving binary interdiction games ⋮ Prioritized interdiction of nuclear smuggling via tabu search ⋮ A two‐stage network interdiction‐monitoring game ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ Network interdiction with asymmetric cost uncertainty ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ A survey of network interdiction models and algorithms ⋮ Modeling interdependencies in infrastructure systems using multi-layered network flows ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms

This page was built for publication: Securing a border under asymmetric information