Multiple searchers searching for a randomly distributed immobile target on a unit network

DOI10.1002/net.21793zbMath1418.90057OpenAlexW2770602782MaRDI QIDQ5228507

Songtao Li, Si-Min Huang

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

zbMATH Keywords

path optimizationexpected search timeimmobile targetmultiple searcherssearcher pathunit network

Mathematics Subject Classification ID

Linear programming (90C05) Search theory (90B40) Deterministic network models in operations research (90B10)

Related Items (3)

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

This page was built for publication: Multiple searchers searching for a randomly distributed immobile target on a unit network