Date of Original Version
Abstract or Description
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time.We integrate the propagator into a constraint solver based on an MDD store introduced in . Our experiments show that the new propagator provides substantial computational advantage over propagation of two inequality constraints, and that the advantage increases when the maximum width of the MDD store increases.
L.Perron and M. A, Trick, eds., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), LNCS 5015, 318- 322.