Branch and bound methods for a search problem

DOI10.1002/(SICI)1520-6750(199804)45:3%3C243::AID-NAV1%3E3.0.CO;2-7MaRDI QIDQ4255007zbMATH OpenOpenAlexFDO

Authors Alan Washburn

Publication date 9 August 1999

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199804)45:3%3C243::aid-nav1%3E3.0.co;2-7

zbMATH Keywords

branch-and-boundrandomly moving targets

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• Using multiple searchers in constrained-path, moving-target search problems
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• A branch-and-bound algorithm applied to optimal radar search pattern
• scientific article; zbMATH DE number 3968305
• Criteria and approximate methods for path-constrained moving-target search problems

Cited in

(21)

• Blocked branch-and-bound method
• Modified branch-and-bound method for solving a series of problems
• Branch-and-bound as a higher-order function
• Trajectory optimization under kinematical constraints for moving target search
• Solving the moving target search problem using indistinguishable searchers
• Moving target search optimization -- a literature review
• Combining interval branch and bound and stochastic search
• Resolution search and dynamic branch-and-bound
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
• An evolutionary approach for the target search problem in uncertain environment
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• About branch and bound method
• Route optimization for multiple searchers
• An innovative multi-agent search-and-rescue path planning approach
• A branch-and-bound algorithm applied to optimal radar search pattern
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• Path optimization for the resource-constrained searcher
• Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target
• Static target search path planning optimization with heterogeneous agents
• An extensible framework for the probabilistic search of stochastically-moving targets characterized by generalized Gaussian distributions or experimentally-defined regions of interest
• An information theoretic based integer linear programming approach for the discrete search path planning problem

This page was built for publication: Branch and bound methods for a search problem

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