Technical Note—The Complexity of the Optimal Searcher Path Problem

• 1 April 1986
• journal article
• Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
• Vol. 34  (2) , 324-327
• https://doi.org/10.1287/opre.34.2.324

Abstract

Keywords

• NOTE
• OPTIMAL SEARCHER
• SEARCHER PATH
• PATH PROBLEM
• NP COMPLETE
• MINIMIZES MEAN
• STATIONARY TARGET