Technical Note—The Complexity of the Optimal Searcher Path Problem

Published Online:https://doi.org/10.1287/opre.34.2.324
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.