MDD propagators with explanation
From MaRDI portal
Publication:429805
DOI10.1007/s10601-011-9111-xzbMath1241.90066OpenAlexW2057501384MaRDI QIDQ429805
Radoslaw Szymanek, Graeme Gange, Peter J. Stuckey
Publication date: 20 June 2012
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-011-9111-x
Related Items
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, MDDs are efficient modeling tools: an application to some statistical constraints, Propagation complete encodings of smooth DNNF theories, From MDD to BDD and arc consistency, Compiling CP subproblems to MDDs and d-DNNFs, Optimal and efficient filtering algorithms for table constraints, Improving the lower bound of simple tabular reduction
Uses Software
Cites Work
- Unnamed Item
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- Propagation via lazy clause generation
- Encodings of the Sequence Constraint
- Decomposing Global Grammar Constraints
- Revisiting the Sequence Constraint
- Global Grammar Constraints
- Fast Set Bounds Propagation Using a BDD-SAT Hybrid
- Graph-Based Algorithms for Boolean Function Manipulation
- Principles and Practice of Constraint Programming – CP 2004