On algorithms for decomposable constraints
From MaRDI portal
Recommendations
- A domain decomposition algorithm for constraint satisfaction
- Computer Science Logic
- Decomposable constraints
- Constraint decomposition algorithms in global optimization
- New structural decomposition techniques for constraint satisfaction problems
- scientific article; zbMATH DE number 4016952
- Fast and parallel decomposition of constraint satisfaction problems
- Decomposition structures for soft constraint evaluation problems: an algebraic approach
Cited in
(7)- General methods for adding range restrictions to decomposable searching problems
- Decomposable constraints
- Domain filtering consistencies for non-binary constraints
- scientific article; zbMATH DE number 4046981 (Why is no real title available?)
- A domain decomposition algorithm for constraint satisfaction
- New structural decomposition techniques for constraint satisfaction problems
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: On algorithms for decomposable constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737933)