Branch and bound methods for a search problem

Naval Research Logistics

Volumn 45, Issue 3, 1998, Pages 243-257

  Washburn, Alan R ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; TRACKING (POSITION);

BRANCH AND BOUND SEARCH METHODS;

LOGISTICS;

EID: 0032048989     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7     Document Type: Article

References (16)

1. Benkoski, S.J., Monticino, M.G., and Weisinger, J.R., "A Survey of the Search Theory Literature," Naval Research Logistics, 38, 469-494 (1991).
2. Brown, S.S., "Optimal Search for a Moving Target in Discrete Time and Space," Operations Research, 28, 1275-1289 (1980).
3. CASIE 3, distributed by NASAR (P.O. Box 3709, Fairfax, VA 22038, 703-352-1349) and ERI (4537 Foxhall Dr. NE, Olympia, WA 98506, 360-491-7785).
4. Dell, R.F., Eagle, J.N., Martins, G.H.A., and Santos, A.G., "Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems," Naval Research Logistics, 43, 463-480 (1996).
5. Eagle, J.N., and Yee, J.R., "An Optimal Branch-and-Bound Procedure tor the Constrained Path, Moving Target Search Problem," Operations Research, 38, 110-114 (1990).
6. Feller, W., An Introduction to Probability Theory and Its Applications, Volume 1, Edition 2, Wiley, New York, 1957, Chap. 15.
7. Martins, G., "A New Branch-and-Bound Procedure for Computing Optimal Search Paths," Master's Thesis, Naval Postgraduate School, 1993.
8. Richardson, H., and Dicenza, J., "The United States Coast Guard Computer-Assisted Search Planning System (CASP)," Naval Research Logistics, 27, 659-680 (1980).
9. Stewart, T.J., "Search for a Moving Target When Search Motion is Restricted," Computers and Operation Research, 6, 129-140 (1979).
10. Stewart, T.J., "Experience With a Branch-and-Bound Method for Constrained Searcher Motion," in B. Haley and L. Stone (Eds.), Search Theory and Applications, Plenum, New York, 1980, pp. 247-253.
11. Stone, L.D., "Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets," Mathematics of Operations Research, 4, 431-440 (1979).
12. Stone, L., and Corwin, T., "NODESTAR: A Nonlinear, Discrete, Multiple-target, Correlator-tracker: Part 1," U.S. Navy Journal of Underwater Acoustics, 45, 525-540, (1995).
13. Wagner, D.H., "Naval Tactical Decision Aids," Military Operations Research Lecture Notes, NPSOR-90-01, Naval Postgraduate School, Monterey, CA, 1989.
14. Washburn, A.R., "An Upper Bound Useful in Optimizing Search for a Moving Target," Operations Research, 29, 1227-1230 (1981).
15. Washburn, A.R., "Search for a Moving Target: The FAB Algorithm," Operations Research, 31, 739-751 (1983).
16. Washburn, A., "Branch and Bound Methods for Search Problems," NPSOR-95-003, Naval Postgraduate School, Monterey, CA, 1995.