A Graph Patrol Problem with Random Attack Times
From MaRDI portal
Publication:2846426
DOI10.1287/opre.1120.1149zbMath1273.90228MaRDI QIDQ2846426
Michael P. Atkinson, Kyle Y. Lin, Timothy H. Chung, Kevin D. Glazebrook
Publication date: 5 September 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1149
Related Items
Adversarial Patrolling in a Uniform, Technical Note—Optimal Patrol of a Perimeter, Continuous Patrolling Games, Optimal patrolling strategies for trees and complete networks, A stochastic game framework for patrolling a border, Optimal search and ambush for a hider who can escape the search region, Optimizing periodic patrols against short attacks on the line and other networks, Continuous patrolling and hiding games, Approximate solutions for expanding search games on general networks, A Markov decision process model on dynamic routing for target surveillance, Patrolling a Border, Patrolling a Pipeline