Pages that link to "Item:Q612225"
From MaRDI portal
The following pages link to On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225):
Displaying 4 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 (Q4321311) (← links)
- The scalability analysis of a parallel tree search algorithm (Q5919087) (← links)