Pages that link to "Item:Q792768"
From MaRDI portal
The following pages link to General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768):
Displaying 17 items.
- Generalized resolution search (Q429682) (← links)
- An efficient data structure for branch-and-bound algorithm (Q558042) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Parallel depth first search. I: Implementation (Q1116343) (← links)
- Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Generalized best first search using single and multiple heuristics (Q1186365) (← links)
- Heuristic search in restricted memory (Q1263290) (← links)
- The log bucking problem: A comparison of dynamic programming versus branch and bound (Q1333552) (← links)
- Are branch and bound and A\(^{\ast}\) algorithms identical? (Q1402513) (← links)
- Application of the laminar Navier-Stokes equations for solving 2D and 3D pathfinding problems with static and dynamic spatial constraints: implementation and validation in Comsol Multiphysics (Q1742686) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables (Q1753593) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- Towards an abstract parallel branch and bound machine (Q6560207) (← links)
- Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)
