Optimal Interdiction of Unreactive Markovian Evaders

DOI10.1007/978-3-642-01929-6_9zbMath1241.90108OpenAlexW1574816868MaRDI QIDQ3630155

Feng Pan, Aric Hagberg, Alexander Gutfraind

Publication date: 3 June 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_9

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Infrastructure security games ⋮ Network routing for insurgency: An adversarial risk analysis framework ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Risk-averse stochastic path detection ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Optimization of stochastic virus detection in contact networks ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold

This page was built for publication: Optimal Interdiction of Unreactive Markovian Evaders