THE COMPLEXITY OF THE OPTIMAL SEARCHER PATH PROBLEM Note

TRUMMEL, KE, WEISINGER, JR. THE COMPLEXITY OF THE OPTIMAL SEARCHER PATH PROBLEM . OPERATIONS RESEARCH, 34(2), 324-327. 10.1287/opre.34.2.324

cited authors

  • TRUMMEL, KE; WEISINGER, JR

authors

published in

keywords

  • Business & Economics
  • Management
  • Operations Research & Management Science
  • Science & Technology
  • Social Sciences
  • Technology

Digital Object Identifier (DOI)

publisher

  • OPERATIONS RESEARCH SOC AMER

start page

  • 324

end page

  • 327

volume

  • 34

issue

  • 2