Multiple searchers searching for a randomly distributed immobile target on a unit network
From MaRDI portal
Publication:5228507
DOI10.1002/net.21793zbMath1418.90057MaRDI QIDQ5228507
Publication date: 12 August 2019
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21793
path optimization; expected search time; immobile target; multiple searchers; searcher path; unit network
90C05: Linear programming
90B40: Search theory
90B10: Deterministic network models in operations research
Related Items
Exact and Approximation Algorithms for the Expanding Search Problem, Search and delivery man problems: when are depth-first paths optimal?, Time-critical testing and search problems