Discrete Sequential Search with Positive Switch Cost

DOI10.1287/moor.7.3.426zbMath0498.90047OpenAlexW2110820483MaRDI QIDQ3964313

Ingo Wegener, Udo Loessner

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.3.426

zbMATH Keywords

existence of optimal strategiesone hidden objectsequential search of boxesstrategy with minimal expected cost

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (9)

A search problem with considering posterior treatments for a detected object ⋮ Technical Note—Trading Off Quick versus Slow Actions in Optimal Search ⋮ Complexity of searching an immobile hider in a graph ⋮ Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ Online failure diagnosis in interdependent networks ⋮ A search problem on a bipartite network ⋮ Honey-pot constrained searching with local sensory information ⋮ Optimal search with positive switch cost is NP-hard ⋮ A SEARCH GAME WITH UNKNOWN EXAMINATION COSTS AND TRAVEL TIMES

This page was built for publication: Discrete Sequential Search with Positive Switch Cost