Operations research applications of dichotomous search

Refael Hassin, Anna Sarid

Research output: Contribution to journalReview articlepeer-review

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 languageEnglish
Pages (from-to)795-812
Number of pages18
JournalEuropean Journal of Operational Research
Volume265
Issue number3
DOIs
StatePublished - 16 Mar 2018

Keywords

  • Alphabetic trees
  • Combinatorial optimization
  • Dichotomous search

Fingerprint

Dive into the research topics of 'Operations research applications of dichotomous search'. Together they form a unique fingerprint.

Cite this