Article ID: | iaor1999244 |
Country: | United States |
Volume: | 45 |
Issue: | 3 |
Start Page Number: | 243 |
End Page Number: | 257 |
Publication Date: | Apr 1998 |
Journal: | Naval Research Logistics |
Authors: | Washburn Alan R. |
Keywords: | programming: integer |
The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch and Bound methods, with emphasis on the tradeoff between the accuracy of the bound employed and the time required to compute it. A variety of bounds are investigated, some of which are new. In most cases the best bounds turn out to be imprecise, but very easy to compute.