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

DOI10.1287/OPRE.38.1.110MaRDI QIDQ5752282zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Criteria and approximate methods for path-constrained moving-target search problems
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• Using multiple searchers in constrained-path, moving-target search problems
• Optimal strategy of route and look for the path constrained search problem with reward criterion

Cited in

(18)

• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
• Moving target search optimization -- a literature review
• Optimal strategy of route and look for the path constrained search problem with reward criterion
• A search game when a search path is given
• Technical note: Trading off quick versus slow actions in optimal search
• Aerial vehicle search-path optimization: a novel method for emergency operations
• Optimal search-relocation trade-off in Markovian-target searching
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Trajectory optimization under kinematical constraints for moving target search
• Criteria and approximate methods for path-constrained moving-target search problems
• Route optimization for multiple searchers
• Solving the moving target search problem using indistinguishable searchers
• Honey-pot constrained searching with local sensory information
• Ant colony optimization for path planning in search and rescue operations
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• Path optimization for the resource-constrained searcher

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5752282)