DICHOTOMOUS SEARCH FOR RANDOM OBJECTS ON AN INTERVAL

被引:6
作者
HASSIN, R [1 ]
HENIG, M [1 ]
机构
[1] TEL AVIV UNIV,FAC MANAGEMENT,IL-69978 TEL AVIV,ISRAEL
关键词
D O I
10.1287/moor.9.2.301
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:301 / 308
页数:8
相关论文
共 11 条
[1]   SEARCH PROBLEM [J].
CAMERON, SH ;
NARAYANA.SG .
OPERATIONS RESEARCH, 1964, 12 (04) :623-&
[2]  
Feller W., 2008, INTRO PROBABILITY TH
[3]   DISCRETE SEARCH GAME [J].
GAL, S .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 27 (04) :641-648
[4]  
HASSIN R, UNPUB OPER RES
[5]  
HASSIN R, OPTIMAL SEARCH ALL J
[6]   OPTIMAL COMPUTER SEARCH TREES AND VARIABLE-LENGTH ALPHABETICAL CODES [J].
HU, TC ;
TUCKER, AC .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 21 (04) :514-&
[7]   SOME THEOREMS ON SORTING [J].
MORRIS, R .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (01) :1-&
[8]   DICHOTOMOUS SEARCH WITH TRAVEL COST [J].
MURAKAMI, S .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1976, 19 (03) :245-254
[9]  
MURAKAMI S, 1974, J OPER RES SOC JAPAN, V14, P127
[10]  
WAGNER WM, 1975, PRINCIPLES OPERATION