| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6895210 | European Journal of Operational Research | 2018 | 40 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Refael Hassin, Anna Sarid,