Hi Jan,
> thank you for the reply. I forgot to mention that we are implementing > disjunctive edge-finder. at http://kti.mff.cuni.cz/~vilim/ you'll find some interesting papers, one of which is "O(n log n) Filtering Algorithms for Unary Resource Constraint" http://kti.mff.cuni.cz/~vilim/nlogn.pdf That's pretty easy to implement. You can also derive a branching for first/lasts quite easily from that. Hope this helps, Filip _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users