Pages that link to "Item:Q4632957"
From MaRDI portal
The following pages link to Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (Q4632957):
Displaying 4 items.
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
