Generalizations in the linear search problem

DOI10.1007/BF02783218zbMath0831.90078OpenAlexW2082019079MaRDI QIDQ1895083

Vic Baston, Anatole Beck

Publication date: 18 January 1996

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02783218

zbMATH Keywords

linear searchstrictly increasing convex function

Mathematics Subject Classification ID

Search theory (90B40)

Related Items

Hide-and-seek games on a tree to which Eulerian networks are attached ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ The Chinese deliveryman problem

Cites Work

• Unnamed Item
• The linear search problem rides again
• Son of the linear search problem
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• The return of the linear search problem
• The Revenge of the Linear Search Problem
• Analytic Inequalities

This page was built for publication: Generalizations in the linear search problem