|
PBeFS
Parallel Best-First Search
|
Parallel best-first searches with an incumbent, i.e., the parallel Branch-and-Bound (B&B) on an executor of ADS (the pool of C++ threads, OpenMP or FastFlow): SharedBranchAndBound, whose workers extract the nodes from one queue as the workers of SPA* do, and DistributedBranchAndBound, whose workers have a queue each and send the children to their owners as the workers of HDA* do. More...
Files | |
| file | ParallelBranchAndBound.h |
| Header file for the parallel best-first searches with an incumbent, i.e., the parallel Branch-and-Bound (B&B) on an executor of ADS (the pool of C++ threads, OpenMP or FastFlow): SharedBranchAndBound, whose workers extract the nodes from one queue as the workers of SPA* do, and DistributedBranchAndBound, whose workers have a queue each and send the children to their owners as the workers of HDA* do. | |
Classes | |
| struct | BasicParallelBBOptions< V > |
| the options of the parallel B&B with values of type V More... | |
| class | BBIncumbent< Node, V > |
| the incumbent shared by the workers of a parallel B&B More... | |
| class | SharedBranchAndBound< P, Executor > |
| the parallel B&B with one queue shared by the workers More... | |
| class | DistributedBranchAndBound< P, Executor > |
| the parallel B&B with a queue per worker and the children sent to their owners More... | |
Parallel best-first searches with an incumbent, i.e., the parallel Branch-and-Bound (B&B) on an executor of ADS (the pool of C++ threads, OpenMP or FastFlow): SharedBranchAndBound, whose workers extract the nodes from one queue as the workers of SPA* do, and DistributedBranchAndBound, whose workers have a queue each and send the children to their owners as the workers of HDA* do.