A Systematic Approach to MDD-Based Constraint Programming
Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systematic approach to MDD-based constraint programming. First, we introduce a generic scheme for constraint propagation in MDDs. We show that all previously known propagation algorithms for MDDs can be expressed using this scheme. Moreover, we use the scheme to produce algorithms for a number of other constraints, including Among, Element, and unary resource constraints. Finally, we discuss an implementation of our MDD-based CP solver, and provide experimental evidence of the benefits of MDD-based constraint programming.
KeywordsLocal Information Feasible Path Binary Constraint Nurse Rostering Individual Constraint
Unable to display preview. Download preview PDF.
- 5.Hadzic, T., O’Mahony, E., O’Sullivan, B., Sellmann, M.: Enhanced Inference for the Market Split Problem. In: Proceedings of ICTAI, pp. 716–723. IEEE, Los Alamitos (2009)Google Scholar
- 7.Hoda, S.: Essays on Equilibrium Computation, MDD-based Constraint Programming and Scheduling. PhD thesis, Carnegie Mellon University (2010)Google Scholar