Portal de Periódicos da CAPES

Introduction special issue on search theory

1991; Wiley; Volume: 38; Issue: 4 Linguagem: Inglês

10.1002/1520-6750(199108)38

1520-6750

Lawrence D. Stone, Alan R. Washburn,

Optimization and Search Problems

Naval Research Logistics (NRL)Volume 38, Issue 4 p. 465-468 Introduction Introduction special issue on search theory Lawrence D. Stone, Lawrence D. Stone Guest Editor Metron, Inc.Search for more papers by this authorAlan R. Washburn, Alan R. Washburn Guest Editor Naval Postgraduate SchoolSearch for more papers by this author Lawrence D. Stone, Lawrence D. Stone Guest Editor Metron, Inc.Search for more papers by this authorAlan R. Washburn, Alan R. Washburn Guest Editor Naval Postgraduate SchoolSearch for more papers by this author First published: August 1991 https://doi.org/10.1002/1520-6750(199108)38:4 3.0.CO;2-LCitations: 1AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat References 1 Brown, S. S., “Optimal Search for a Moving Target in Discrete Time and Space,” Operations Research, 28, 1275–1289 (1980). 2 Dobbie, J. M., “A Survey of Search Theory,” Operations Research 16, 525–537 (1968). 3 Eagle, J. N., and Yee, J. R., “An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem,” Operations Research, 38, 110–114 (1990). 4 Koopman, B. O., “The Theory of Search, Pt. I. Kinematic Bases,” Operations Research 4, 324–346 (1956a). 5 Koopman, B. O., “The Theory of Search, Pt. II Target Detection,” Operations Research 4, 503–531 (1956b). 6 Koopman, B. O., “The Theory of Search, Pt. III. The Optimum Distribution of Searching Effort,” Operations Research 5, 613–626 (1957). 7 Koopman, B. O., Search and Screening. Operations Evaluation Group Report No. 56. Center for Naval Analyses, Alexandria, Virginia, 1946. 8 Morse, P. M., “In Memoriam: Bernard Osgood Koopman. 1900–1981,” Operations Research 30, 417–427 (1982). 9 Stewart, T. J., “Search for a Moving Target when Searcher Motion is Restricted,” Computers & Operations Research 6, 129–140 (1979). 10 Stewart, T. J., “ Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion,” in Search Theory and Applications. K. B. Haley and L. D. Stone (eds.). Plenum Press, New York, 1980. 11 Stone, L. D. 1975. Theory of Optimal Search. Academic Press, New York. 12 L. D., Brown, S. S., Buemi, R. P., and Hopkins, C. R., Numerical Optimization of Search for a Moving Target. Daniel H. Wagner, Associates Report to Office of Naval Research, 1978. 13 Stromquist, W. R., and Stone, L. D., “Constrained Optimization of Functionals with Search Theory Applications,” Math. Operations Research 6, 518–529 (1981). 14 Thomas, L. C. and Washburn, A. R., “Dynamic Search Games,” Operations Research 39 (1991). 15 Trummel, K. E., and Weisinger, J. R., “The Complexity of the Optimal Searcher Path Problem,” Operations Research 34, 324–327 (1986). 16 Washburn, A. R., “On Search for a Moving Target,” Naval Logist. Quart. 27, 315–322 (1980). 17 Washburn, A. R., “Search for a Moving Target: The FAB Algorithm,” Operations Research 31, 739–751 (1983). Citing Literature Volume38, Issue4August 1991Pages 465-468 ReferencesRelatedInformation