DISCRETE SEARCH AND NEYMAN-PEARSON LEMMA

被引：43

作者：

KADANE, JB

机构：

来源：

关键词：

D O I：

10.1016/0022-247X(68)90167-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：156 / &

共 13 条

[1]

Bellman R.E, 1957, DYNAMIC PROGRAMMING

[2]

BLACK W, 1965, INFORM CONTR, V8, P156

[3] A SEQUENTIAL SEARCH PROCEDURE [J].

CHEW, MC .

ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02) :494-&

[4]

CHU WK, UNPUBLISHED

[5]

Dantzig G.B., 1963, LINEAR PROGRAMMING

ENSLOW, PH .

NAVAL RESEARCH LOGISTICS QUARTERLY, 1966, 13 (02) :177-&

[7] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].

LAND, AH ;

DOIG, AG .

[8] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

[9]

LEHMANN EL, 1959, TESTING STATISTICAL

[10] PERIODIC OPTIMAL SEARCH [J].

MATULA, D .