Symmetry Definitions for Constraint Satisfaction Problems
From MaRDI portal
Recommendations
Cited in
(20)- On implementing symmetry detection
- Dynamic structural symmetry breaking for constraint satisfaction problems
- Orbital shrinking: theory and applications
- Speeding up operations on feature terms using constraint programming and variable symmetry
- Symmetry in mathematical programming
- Local Symmetry Breaking During Search in CSPs
- Groupoids and Conditional Symmetry
- Symmetry and Consistency
- Exploiting single-cycle symmetries in continuous constraint problems
- Dominance rules in combinatorial optimization problems
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- scientific article; zbMATH DE number 2084753 (Why is no real title available?)
- Symmetry and Satisfiability: An Update
- A Novel Approach For Detecting Symmetries in CSP Models
- Symmetry Breaking for Maximum Satisfiability
- Automatic Generation of Symmetry-Breaking Constraints
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Symmetry definitions for constraint satisfaction problems
- Minimal ordering constraints for some families of variable symmetries
This page was built for publication: Symmetry Definitions for Constraint Satisfaction Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524161)