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

DOI10.1287/OPRE.29.6.1227MaRDI QIDQ3929384zbMATH OpenOpenAlexFDO

Authors Alan 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

computation of optimal search planmaximum detection probabilitymoving targetsequence of nondecreasing upper bounds

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 18751
• Dynamic search for a moving target
• Branch and bound methods for a search problem
• Publication:4890661
• scientific article; zbMATH DE number 3968305

Cited in

(4)

• Search for a moving element with the minimum total cardinality of tests
• Search for point in interval, with high–low feedback
• scientific article; zbMATH DE number 18751 (Why is no real title available?)
• scientific article; zbMATH DE number 2078355 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929384)