Operations research applications of dichotomous search

Refael Hassin; Anna Sarid

doi:10.1016/j.ejor.2017.07.031

Operations research applications of dichotomous search

Refael Hassin^*, Anna Sarid

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Review article › peer-review

8 Scopus citations

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	https://doi.org/10.1016/j.ejor.2017.07.031
State	Published - 16 Mar 2018

Keywords

Alphabetic trees
Combinatorial optimization
Dichotomous search

Access to Document

10.1016/j.ejor.2017.07.031

Cite this

@article{b9a7e8fd68334df89f1956b302080a80,

title = "Operations research applications of dichotomous search",

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.",

keywords = "Alphabetic trees, Combinatorial optimization, Dichotomous search",

author = "Refael Hassin and Anna Sarid",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2018",

month = mar,

day = "16",

doi = "10.1016/j.ejor.2017.07.031",

language = "אנגלית",

volume = "265",

pages = "795--812",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Operations research applications of dichotomous search

AU - Hassin, Refael

AU - Sarid, Anna

PY - 2018/3/16

Y1 - 2018/3/16

N2 - 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.

AB - 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.

KW - Alphabetic trees

KW - Combinatorial optimization

KW - Dichotomous search

UR - http://www.scopus.com/inward/record.url?scp=85025151931&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2017.07.031

DO - 10.1016/j.ejor.2017.07.031

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.systematicreview???

AN - SCOPUS:85025151931

SN - 0377-2217

VL - 265

SP - 795

EP - 812

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Operations research applications of dichotomous search

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this