|
PBeFS
Parallel Best-First Search
|
MPIBranchAndBound, the distributed Branch-and-Bound (B&B) with one MPI process per worker: each process has a queue of open nodes and sends the children to their owners, as DistributedBranchAndBound does with threads [see ParallelBranchAndBound.h] and HDAStarMPI with the states of A* [see HDAStarMPI.h]. More...
Files | |
| file | MPIBranchAndBound.h |
| Header file for MPIBranchAndBound, the distributed Branch-and-Bound (B&B) with one MPI process per worker: each process has a queue of open nodes and sends the children to their owners, as DistributedBranchAndBound does with threads [see ParallelBranchAndBound.h] and HDAStarMPI with the states of A* [see HDAStarMPI.h]. | |
Concepts | |
| concept | PBeFS_di_unipi_it::MPIBranchAndBound |
| a B&B problem whose nodes and values can travel between processes | |
Classes | |
| class | MPIBranchAndBoundSearch< P > |
| the distributed B&B with one MPI process per worker More... | |
MPIBranchAndBound, the distributed Branch-and-Bound (B&B) with one MPI process per worker: each process has a queue of open nodes and sends the children to their owners, as DistributedBranchAndBound does with threads [see ParallelBranchAndBound.h] and HDAStarMPI with the states of A* [see HDAStarMPI.h].