Operations research applications of dichotomous search

被引：7
|
作者：
Hassin, Refael [1 ]
Sarid, Anna [1 ]
机构：
[1] Tel Aviv Univ, Dept Stat & Operat Res, IL-69978 Tel Aviv, Israel
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2018年 / 265卷 / 03期
关键词：
Combinatorial optimization; Dichotomous search; Alphabetic trees; OFF-LINE INSPECTION; ALPHABETIC BINARY-TREES; ECONOMIC OPTIMIZATION; MINIMAX TREES; DIRECTIONAL INFORMATION; NONUNIFORM COSTS; DISCRETE SEARCH; FIBONACCI TREES; PROCESS SUBJECT; PREFIX CODE;
D O I：
10.1016/j.ejor.2017.07.031
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：795 / 812
页数：18
相关论文
共 50 条
12345