Pages that link to "Item:Q4255007"
From MaRDI portal
The following pages link to Branch and bound methods for a search problem (Q4255007):
Displaying 20 items.
- An innovative multi-agent search-and-rescue path planning approach (Q337250) (← links)
- Static target search path planning optimization with heterogeneous agents (Q512934) (← links)
- An information theoretic based integer linear programming approach for the discrete search path planning problem (Q895784) (← links)
- Blocked branch-and-bound method (Q1088598) (← links)
- Modified branch-and-bound method for solving a series of problems (Q1113803) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Trajectory optimization under kinematical constraints for moving target search (Q1651570) (← links)
- Solving the moving target search problem using indistinguishable searchers (Q1711443) (← links)
- Moving target search optimization -- a literature review (Q1722971) (← links)
- Combining interval branch and bound and stochastic search (Q1725151) (← links)
- Resolution search and dynamic branch-and-bound (Q1810862) (← links)
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
- An evolutionary approach for the target search problem in uncertain environment (Q2331590) (← links)
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183) (← links)
- About branch and bound method (Q2793055) (← links)
- Route optimization for multiple searchers (Q3065632) (← links)
- A branch-and-bound algorithm applied to optimal radar search pattern (Q3445938) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- Path optimization for the resource-constrained searcher (Q3580160) (← links)
- Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target (Q3929384) (← links)
