Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target

DOI10.1287/OPRE.29.6.1227zbMath0474.90050OpenAlexW2104866506MaRDI QIDQ3929384

Alan R. Washburn

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.6.1227

zbMATH Keywords

moving targetmaximum detection probabilitycomputation of optimal search plansequence of nondecreasing upper bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Search theory (90B40)

This page was built for publication: Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target