Symmetry breaking constraints for value symmetries in constraint satisfaction
From MaRDI portal
(Redirected from Publication:850460)
Recommendations
Cites work
- Artificial Intelligence and Symbolic Computation
- Consistency in networks of relations
- Excluding symmetries in constraint-based search
- Exploiting symmetries within constraint satisfaction search
- Generic SBDD using computational group theory
- scientific article; zbMATH DE number 2084698 (Why is no real title available?)
- scientific article; zbMATH DE number 2084699 (Why is no real title available?)
- scientific article; zbMATH DE number 1487977 (Why is no real title available?)
- Increasing constraint propagation by redundant modeling: An experience report
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Letter to the Editor—The Multidimensional Assignment Problem
- New methods to color the vertices of a graph
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Propagation redundancy in redundant modelling
- Removing propagation redundant constraints in redundant modeling
- Solving Kirkman's schoolgirl problem in a few seconds
- Symmetry breaking revisited
- Symmetry breaking using stabilizers
- The Temporal Knapsack Problem and Its Solution
Cited in
(14)- Dynamic structural symmetry breaking for constraint satisfaction problems
- Towards breaking more composition symmetries in partial symmetry breaking
- Pairwise symmetry reasoning for multi-agent path finding search
- Constraint models for graceful graphs
- Lightweight dynamic symmetry breaking
- Automatic generation of redundant models for permutation constraint satisfaction problems
- Breaking Symmetry of Interchangeable Variables and Values
- Automatic Detection of Variable and Value Symmetries
- Breaking All Value Symmetries in Surjection Problems
- Symmetry and Satisfiability: An Update
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Symmetry Breaking for Maximum Satisfiability
- Principles and Practice of Constraint Programming – CP 2004
- Multicriteria models for planning power-networking events
This page was built for publication: Symmetry breaking constraints for value symmetries in constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850460)
