Dichotomous Search for Random Objects on an Interval
From MaRDI portal
Publication:3320109
DOI10.1287/MOOR.9.2.301zbMATH Open0535.90050OpenAlexW2008165863MaRDI QIDQ3320109FDOQ3320109
Authors: Refael Hassin, Mordecai Henig 
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.9.2.301
Recommendations
- Monotonicity and efficient computation of optimal dichotomous search
- Asymptotic analysis of dichotomous search with search and travel costs
- Optimal sequential search: A Bayesian approach
- On dichotomous search with direction-dependent costs for a uniformly hidden object
- Operations research applications of dichotomous search
optimal strategyselection strategydichotomous searcha partitioninterval of integersminimization of expected search cost
Cited In (12)
- Pessimal guesses may be optimal: a counterintuitive search result
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Optimal search for one of many objects hidden in two boxes
- Continuous and discrete search for one of many objects
- On dichotomous search with direction-dependent costs for a uniformly hidden object
- Discrete Search with Directional Information
- The random threshold and the bisection
- Monotonicity and efficient computation of optimal dichotomous search
- A Dichotomous Search for a Geometric Random Variable
- On a one-dimensional interval search problem
- Operations research applications of dichotomous search
- Random search in a bounded area
This page was built for publication: Dichotomous Search for Random Objects on an Interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320109)
