Discrete Sequential Search with Positive Switch Cost

DOI10.1287/MOOR.7.3.426MaRDI QIDQ3964313zbMATH OpenOpenAlexFDO

Authors Udo Loessner, Ingo Wegener

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)

Cited in

(10)

• Optimal search with positive switch cost is NP-hard
• Complexity of searching an immobile hider in a graph
• A search problem on a bipartite network
• Online failure diagnosis in interdependent networks
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Honey-pot constrained searching with local sensory information
• A search game with unknown examination costs and travel times
• Technical note: Trading off quick versus slow actions in optimal search
• A search problem with considering posterior treatments for a detected object
• Approximation algorithms for graph search problems with imperfect detection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964313)