An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

DOI10.1287/opre.38.1.110zbMath0719.90042OpenAlexW2038435222MaRDI QIDQ5752282

James N. Eagle, James R. Yee

Publication date: 1990

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1dac2e9e529e299b3509628b5eb2be6ae5931908

zbMATH Keywords

discrete timeconstrained path, moving target search problemtrue lower bound

Mathematics Subject Classification ID

Integer programming (90C10) Search theory (90B40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

Technical Note—Trading Off Quick versus Slow Actions in Optimal Search ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ Aerial vehicle search-path optimization: a novel method for emergency operations ⋮ Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Moving target search optimization -- a literature review ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Path optimization for the resource-constrained searcher ⋮ Honey-pot constrained searching with local sensory information ⋮ Route optimization for multiple searchers ⋮ Optimal search-relocation trade-off in Markovian-target searching ⋮ Optimal strategy of route and look for the path constrained search problem with reward criterion ⋮ A search game when a search path is given ⋮ Ant colony optimization for path planning in search and rescue operations

This page was built for publication: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem