Abstract
An object is searched for in {1,⋯,N}. Queries for the object are sequentially conducted. A query at x reveals whether the object's location is greater than x. The objective is to find the object within a minimal expected number of queries. This problem is called the “dichotomous search” problem and has many versions. This paper surveys dichotomous search problems with the emphasis on Operations Research applications.
Original language | English |
---|---|
Pages (from-to) | 795-812 |
Number of pages | 18 |
Journal | European Journal of Operational Research |
Volume | 265 |
Issue number | 3 |
DOIs | |
State | Published - 16 Mar 2018 |
Keywords
- Alphabetic trees
- Combinatorial optimization
- Dichotomous search