Approximately optimal one‐dimensional search policies in which search costs vary through time
From MaRDI portal
Publication:5332964
DOI10.1002/nav.3800080309zbMath0126.15803OpenAlexW2066736533MaRDI QIDQ5332964
Publication date: 1961
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800080309
Related Items
A search problem with considering posterior treatments for a detected object ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Rendezvous search on a star graph with examination costs ⋮ A search problem on a bipartite network ⋮ Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions ⋮ A SEARCH GAME WITH UNKNOWN EXAMINATION COSTS AND TRAVEL TIMES
Cites Work