Asymptotic analysis of dichotomous search with search and travel costs

Refael Hassin; Reuven Hotovely

doi:10.1016/0377-2217(92)90237-4

Asymptotic analysis of dichotomous search with search and travel costs

Refael Hassin^*
, Reuven Hotovely

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

An object to be searched lies on [0, n]. The search starts from the left end of the interval. A query at a point finds out whether the objects lies to the left or to the right of the point. The problem is to determine a sequence of queries that minimizes the expected sum of query (c_Q per attempt) and travel (c_T per unit distance) costs required to locate the object within an interval of unit length. This work develops simple approximate solutions to the problem and analyzes their performance.

Original language	English
Pages (from-to)	78-89
Number of pages	12
Journal	European Journal of Operational Research
Volume	58
Issue number	1
DOIs	https://doi.org/10.1016/0377-2217(92)90237-4
State	Published - 10 Apr 1992

Keywords

Dichotomous search
dynamic programming

Access to Document

10.1016/0377-2217(92)90237-4

Cite this

@article{08745f3f36c54e36a4a990bab0b2cc08,

title = "Asymptotic analysis of dichotomous search with search and travel costs",

abstract = "An object to be searched lies on [0, n]. The search starts from the left end of the interval. A query at a point finds out whether the objects lies to the left or to the right of the point. The problem is to determine a sequence of queries that minimizes the expected sum of query (cQ per attempt) and travel (cT per unit distance) costs required to locate the object within an interval of unit length. This work develops simple approximate solutions to the problem and analyzes their performance.",

keywords = "Dichotomous search, dynamic programming",

author = "Refael Hassin and Reuven Hotovely",

year = "1992",

month = apr,

day = "10",

doi = "10.1016/0377-2217(92)90237-4",

language = "אנגלית",

volume = "58",

pages = "78--89",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Asymptotic analysis of dichotomous search with search and travel costs

AU - Hassin, Refael

AU - Hotovely, Reuven

PY - 1992/4/10

Y1 - 1992/4/10

N2 - An object to be searched lies on [0, n]. The search starts from the left end of the interval. A query at a point finds out whether the objects lies to the left or to the right of the point. The problem is to determine a sequence of queries that minimizes the expected sum of query (cQ per attempt) and travel (cT per unit distance) costs required to locate the object within an interval of unit length. This work develops simple approximate solutions to the problem and analyzes their performance.

AB - An object to be searched lies on [0, n]. The search starts from the left end of the interval. A query at a point finds out whether the objects lies to the left or to the right of the point. The problem is to determine a sequence of queries that minimizes the expected sum of query (cQ per attempt) and travel (cT per unit distance) costs required to locate the object within an interval of unit length. This work develops simple approximate solutions to the problem and analyzes their performance.

KW - Dichotomous search

KW - dynamic programming

UR - https://www.scopus.com/pages/publications/0026853667

U2 - 10.1016/0377-2217(92)90237-4

DO - 10.1016/0377-2217(92)90237-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026853667

SN - 0377-2217

VL - 58

SP - 78

EP - 89

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

Asymptotic analysis of dichotomous search with search and travel costs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this