|
PBeFS
Parallel Best-First Search
|
a B&B problem whose nodes and values can travel between processes More...
#include <PBeFS/bnb/MPIBranchAndBound.h>
a B&B problem whose nodes and values can travel between processes
The values are trivially copyable, and travel as their bytes; either the node is trivially copyable too, or the problem gives serialize( n , out ), which appends the bytes of the node n to the std::vector< char > out, and deserialize( in ), which rebuilds a node from the bytes at the const char * in and moves in past them.