Technical Note—The Complexity of the Optimal Searcher Path Problem

K. E. Trummel and J. R. Weisinger
Additional contact information
K. E. Trummel: Daniel H. Wagner, Associates, Sunnyvale, California
J. R. Weisinger: Daniel H. Wagner, Associates, Sunnyvale, California

Operations Research, 1986, vol. 34, issue 2, 324-327

Abstract: In this note we show that the problem of finding an optimal searcher path that maximizes the probability of detecting a stationary target by the end of a fixed time is NP-complete. We also demonstrate that the problem of finding a path that minimizes mean time to detection is NP-hard.

Keywords: 751; optimal; searcher; path; problem (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.2.324 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:2:p:324-327

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().