References
- IidaKStudies on the Optimal Search Plan1992
- BenkoskiSJA survey of the search theory literatureNaval Res Logist19913846949410.1002/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E
- CharnesASchroederRGOn some stochastic tactical antisubmarine gamesNaval Res Logist Q19671429131110.1002/nav.3800140303
- ThomasLCWashburnARDynamic search gamesOpns Res19913941542210.1287/opre.39.3.415
- StoneLDTheory of Optimal Search1975
- DenbighKGDenbighJSEntropy in Relation to Incomplete Knowledge1985
- JessopAInformed Assessments: an Introduction to Information, Entropy and Statistics1995
- Willemse BP (1996). TOPICS, The New Myopic Algorithm TNO-FEL, Report FEL-96-S202, Stg. Confidentieel.
Further reading
- BrownSSOptimal search for a moving target in discrete time and spaceOpns Res1980281275128910.1287/opre.28.6.1275
- DanskinJMA helicopter versus submarine search gameOpns Res19681650951710.1287/opre.16.3.509
- EagleJNThe optimal search for a moving target when the search path is constrainedOpns Res1984321107111510.1287/opre.32.5.1107
- EagleJNYeeJRAn optimal branch-and-bound procedure for the constrained path, moving target search problemOpns Res19903811011410.1287/opre.38.1.110
- GalSSearch games with mobile and immobile hiderSIAM J Control Optim1979179912210.1137/0317009
- KoopmanBOSearch and Screening: General Principles with Historical Applications1980
- LukkaMOn the optimal searching tracks for a moving targetSIAM J Appl Math19773212613210.1137/0132010
- StewartTJSearch for a moving target when searcher motion is restrictedComput Opns Res1979612914010.1016/0305-0548(79)90025-X
- ThomasLCEagleJNCriteria and approximate methods for path-constrained moving-target search problemsNaval Res Logist199542273810.1002/1520-6750(199502)42:1<27::AID-NAV3220420105>3.0.CO;2-H
- TrummelKEWeisingerJRThe complexity of optimal searcher path problemOpns Res19863432432710.1287/opre.34.2.324
- WashburnAROn a search for a moving targetNaval Logist Quart19802731532210.1002/nav.3800270214