Modularity-based decompositions for valued CSP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 2243365 (Why is no real title available?)
- A domain decomposition algorithm for constraint satisfaction
- A unified theory of structural tractability for constraint satisfaction problems
- Arc consistency for soft constraints
- Complexity classifications of Boolean constraint satisfaction problems
- Consistency in networks of relations
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- High-order consistency in valued constraint satisfaction
- Pseudo-Boolean optimization
- Radio link frequency assignment
- Reduction operations in fuzzy or valued constraint satisfaction
- Soft arc consistency revisited
- The Effect of Constraint Representation on Structural Tractability
- Tractable triangles and cross-free convexity in discrete optimisation
Cited in
(2)
This page was built for publication: Modularity-based decompositions for valued CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353312)