Hybrid tractable classes of constraint problems
From MaRDI portal
Publication:4993597
Recommendations
Cites work
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- scientific article; zbMATH DE number 1149412 (Why is no real title available?)
- A Sufficient Condition for Backtrack-Free Search
- A hybrid tractable class for non-binary CSPs
- A sufficient condition for backtrack-bounded search
- An algebraic theory of complexity for discrete optimization.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
- Characterising tractable constraints
- Classifying the Complexity of Constraints Using Finite Algebras
- Colouring, constraint satisfaction, and complexity
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Constraint tightness and looseness versus local and global consistency
- Discrete Convex Analysis
- Domain permutation reduction for constraint satisfaction problems
- Effectiveness of structural restrictions for hybrid CSPs
- Even delta-matroids and the complexity of planar Boolean CSPs
- Fanout limitations on constraint systems
- From local to global consistency
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Graph minors. XX: Wagner's conjecture
- Hybrid tractability of valued constraint problems
- Mathematical Foundations of Computer Science 2003
- On Planar Boolean CSP
- On Planar Valued CSPs
- On global warming: Flow-based soft global constraints
- Recognizing Berge graphs
- Some new tractable classes of CSPs and their relations with backtracking algorithms
- Symmetry definitions for constraint satisfaction problems
- The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
- The complexity of conservative valued CSPs
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The ellipsoid method and its consequences in combinatorial optimization
- The power of linear programming for general-valued CSPs
- The strong perfect graph theorem
- The tractability of CSP classes defined by forbidden patterns
- Tractability and learnability arising from algebras with few subpowers
- Tractable constraints on ordered domains
- Tractable triangles and cross-free convexity in discrete optimisation
- Variable and value elimination in binary constraint satisfaction via forbidden patterns
Cited in
(12)- Beyond JWP: a tractable class of binary VCSPs via M-convex intersection
- Tractability in constraint satisfaction problems: a survey
- A hybrid tractable class for non-binary CSPs
- Hybrid tractability of valued constraint problems
- A tractable class of binary VCSPs via M-convex intersection
- Galois connections for patterns: an algebra of labelled graphs
- Effectiveness of structural restrictions for hybrid CSPs
- PTAS for Sparse General-valued CSPs
- The complexity of valued CSPs
- Hybrid VCSPs with crisp and valued conservative templates
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
- Heterogeneous constraint solving
This page was built for publication: Hybrid tractable classes of constraint problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993597)
