A search problem with considering posterior treatments for a detected object

DOI10.1080/02522667.2004.10699590zbMath1117.90316OpenAlexW2001924008MaRDI QIDQ5293406

Teruhisa Nakai

Publication date: 2 July 2007

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2004.10699590

Mathematics Subject Classification ID

Search theory (90B40) Case-oriented studies in operations research (90B90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Discrete search and the Neyman-Pearson lemma
• The Theory of Search: Optimum Distribution of Search Effort
• Optimal Search Strategies
• A differential equation model of search for randomly arriving and departing targets
• Discrete Sequential Search with Positive Switch Cost
• Approximately optimal one‐dimensional search policies in which search costs vary through time
• Optimal Search in the Presence of Poisson-Distributed False Targets
• Optimal Search for Detecting a Hidden Object

This page was built for publication: A search problem with considering posterior treatments for a detected object