[Gecode] RE: Recomputation + BAB

Christian Schulte schulte at imit.kth.se
Mon Nov 24 15:53:48 CET 2003


I just completed (well but recomputation for BAB...) the cleanup of the
search engines. The now reside in a namespace Search. Of particular intrest
ought to be Search::DFS and Search::BAB (which now requires a method
constraint to be implemented by the script to be run).

As it comes to batch recomputation you are perfectly correct: what you can
get as a description is an ADT. The only things of your concenr are then the
two methods you mention. If you want to know who branching descriptions can
be constructed and used, please check int/branching/branch.cc

Cheers
Christian

-- 
Christian Schulte, http://www.imit.kth.se/~schulte/ 

> -----Original Message-----
> From: Guido Tack [mailto:tack at ps.uni-sb.de] 
> Sent: Monday, November 24, 2003 14:43
> To: Christian Schulte; gecode at ps.uni-sb.de
> Subject: Recomputation + BAB
> 
> 
> Hi Christian!
> 
> I just had a look at the new search engines in gecode, and it 
> seems you once 
> more tried to get around implementing branch-and-bound with 
> recomputation ;-)
> 
> But here's my real question: What do I need to provide batch 
> recomputation 
> through the Alice interface? Just the description() and 
> commit(alt, desc) 
> functions? Can I simply regard a description as a value of an 
> abstract type?
> 
> Regards,
> 
> 	Guido
> 
> -- 
> Guido Tack
> Programming Systems Lab
> http://www.ps.uni-sb.de/~tack
> 




More information about the gecode-users mailing list