Show simple item record

dc.contributor.authorDell, Robert F.
dc.contributor.authorEagle, James N.
dc.contributor.authorMartins, Gustavo Henrique Alves
dc.contributor.authorSantos, Almir Garnier
dc.date1996
dc.date.accessioned2014-01-09T22:23:09Z
dc.date.available2014-01-09T22:23:09Z
dc.date.issued1996
dc.identifier.citationDell, 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, 1996, pp. 463-480.
dc.identifier.urihttp://hdl.handle.net/10945/38187
dc.descriptionNaval Research Logistics, 43, 1996, pp. 463-480.en_US
dc.description.abstractThe search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive...en_US
dc.rightsdefined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleUsing Multiple Searchers in Constrained-Path, Moving-Target Search Problemsen_US
dc.typeArticleen_US
dc.contributor.departmentOperations Research (OR)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record