Hi, Suppose one has a non-monotonic propagator P, because the propagator uses an approximation (of a NP-Hard problem) of the pruning. How can Gecode accomodate of this situation? Does this mean that recomputation cannot be used? Is the result correct if the recomputation is not used (full copying, c_d=1)?
What about executing the propag P after the fixpoint of all other monotonic constraints? Thank you, Zampelli Stéphane. _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
