Branch and bound methods for a search problem
From MaRDI portal
Publication:4255007
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7" /><243::AID-NAV1>3.0.CO;2-7 10.1002/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7zbMath0927.90058OpenAlexW2008220096MaRDI QIDQ4255007
Publication date: 9 August 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199804)45:3<243::aid-nav1>3.0.co;2-7
Related Items (10)
An innovative multi-agent search-and-rescue path planning approach ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ An information theoretic based integer linear programming approach for the discrete search path planning problem ⋮ 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 ⋮ Static target search path planning optimization with heterogeneous agents ⋮ Path optimization for the resource-constrained searcher ⋮ Route optimization for multiple searchers ⋮ An evolutionary approach for the target search problem in uncertain environment
This page was built for publication: Branch and bound methods for a search problem
