Technical Note—The Complexity of the Optimal Searcher Path Problem
Published Online:1 Apr 1986https://doi.org/10.1287/opre.34.2.324
Use this option if you have an account on informs.org or if you want to become an INFORMS member
Member LoginApril 16, 2013 - May 25, 2026
April 16, 2013 - May 25, 2026
K. E. Trummel
Daniel H. Wagner, Associates, Sunnyvale, California
J. R. Weisinger
Daniel H. Wagner, Associates, Sunnyvale, California

© 1986 INFORMS
