34 #ifndef __GECODE_SEARCH_PAR_BAB_HH__
35 #define __GECODE_SEARCH_PAR_BAB_HH__
39 namespace Gecode {
namespace Search {
namespace Par {
42 template<
class Tracer>
89 virtual void run(
void);
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
No-goods recorded from restarts.
Parallel branch-and-bound search worker
void find(void)
Try to find some work.
Space * best
Best solution found so far.
int mark
Number of entries not yet constrained to be better.
void better(Space *b)
Accept better solution b.
BAB & engine(void) const
Provide access to engine.
virtual ~Worker(void)
Destructor.
virtual void run(void)
Start execution of worker.
Parallel branch-and-bound engine
Worker ** _worker
Array of worker references.
void solution(Space *s)
Report solution s.
Worker * worker(unsigned int i) const
Provide access to worker i.
virtual void constrain(const Space &b)
Constrain future solutions to be better than b.
virtual void reset(Space *s)
Reset engine to restart at space s.
virtual ~BAB(void)
Destructor.
Space * best
Best solution so far.
BAB(Space *s, const Options &o)
Initialize for space s with options o.
virtual Statistics statistics(void) const
Return statistics.
virtual NoGoods & nogoods(void)
Constrain Return no-goods.
Parallel depth-first search engine
Gecode::IntArgs i({1, 2, 3, 4})