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