Dear Gecoders,
I am working on a small problem where the CSP variables are split into two subsets A and B.
For set A, a full enumeration of all valid assignments is wanted while for set B a single check for a valid assignment is sufficent.
Some years ago with Gecode 1.3 I wrote my own branching that did the latter part. Thus, first normal branch on A followed by pseudo-branching on B. The latter stopped the subsearch for B after the first solution was found such that the search in A was continued and so on.
So my question: is there a direct support for such a scheme in Gecode 3.7? Or do I have to find my old branching implementation and make it ready for the new version? I am crossing fingers you have something ready.. :/
Thanks for your help, Martin -- Dr. Martin Mann, Postdoc assistant Bioinformatics - Inst. of Computer Science Albert-Ludwigs-University Freiburg Tel: ++49-761-203-8254 Fax: ++49-761-203-7462 http://www.bioinf.uni-freiburg.de/~mmann/ _______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
