Propagating separable equalities in an MDD store

Tarik Hadzic, John N. Hooker, Peter Tiedemann

    Publikation: Artikel i tidsskrift og konference artikel i tidsskriftKonferenceartikelForskningpeer review

    Abstrakt

    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 [1]. 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.
    OriginalsprogEngelsk
    BogserieLecture Notes in Computer Science
    Sider (fra-til)318-322
    ISSN0302-9743
    DOI
    StatusUdgivet - 2008
    BegivenhedCPAIOR 2008:The Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - Paris, Frankrig
    Varighed: 20 maj 200823 maj 2008

    Konference

    KonferenceCPAIOR 2008:The Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
    Land/OmrådeFrankrig
    ByParis
    Periode20/05/200823/05/2008

    Citationsformater