[gecode-users] Non-monotonic propagator.
Zampelli Stephane
stephane.zampelli at uclouvain.be
Tue Jul 1 18:46:02 CEST 2008
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.
More information about the gecode-users
mailing list