Discrete search and the Neyman-Pearson Lemma
- 1 April 1968
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 22 (1), 156-171
- https://doi.org/10.1016/0022-247x(68)90167-4
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A Branch and Bound Algorithm for the Knapsack ProblemManagement Science, 1967
- A Sequential Search ProcedureThe Annals of Mathematical Statistics, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- A bibliography of search theory and reconnaissance theory literatureNaval Research Logistics Quarterly, 1966
- Discrete sequential searchInformation and Control, 1965
- A Periodic Optimal SearchThe American Mathematical Monthly, 1964
- On a Searching ProblemTheory of Probability and Its Applications, 1963
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960