The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities

DOI10.1287/MOOR.5.3.373MaRDI QIDQ3885498zbMATH OpenOpenAlexFDO

Authors Ingo Wegener

Publication date 1980

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

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

zbMATH Keywords

computation of optimal strategiesdiscrete sequential search problemexistence of admissible strategiesexistence of optimal strategiesnecessary and sufficient conditionsnonrandom costoptimal search strategyoverlook probabilities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Search theory (90B40)

Cited in

(4)

• Finding a hider by an unknown deadline
• Technical note: Trading off quick versus slow actions in optimal search
• scientific article; zbMATH DE number 7271257 (Why is no real title available?)
• Optimal discrete search with imperfect specificity

This page was built for publication: The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities

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