An Optimal Search Problem
From MaRDI portal
Publication:5510386
DOI10.1137/1007106zbMath0136.14701OpenAlexW2077296948MaRDI QIDQ5510386
Publication date: 1965
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1007106
Related Items
Dynamic programming and the backpacker's linear search problem ⋮ Existence of a periodic search strategy for a parabolic spiral target motion in the plane ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Optimal multiplicative generalized linear search plan for a discrete random walker ⋮ Multiplicative linear search for a Brownian target motion ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ Lower bounds for searching robots, some faulty ⋮ Lower bounds in on-line geometric searching ⋮ Son of the linear search problem ⋮ Searching for the Random Walking microorganism cells ⋮ Optimal searching for a Helix target motion ⋮ Star search -- a different show ⋮ Yet more on the linear search problem ⋮ On the minimality of search paths under absolutely continuous univariate distributions ⋮ Optimal search paths for random variables