TY - JOUR
T1 - Operations research applications of dichotomous search
AU - Hassin, Refael
AU - Sarid, Anna
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
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
VL - 265
SP - 795
EP - 812
JO - European Journal of Operational Research
JF - European Journal of Operational Research
SN - 0377-2217
IS - 3
ER -