A method for detecting symmetries in constraint models and its generalisation
From MaRDI portal
Publication:2342650
DOI10.1007/s10601-014-9175-5zbMath1316.90029OpenAlexW2120598107MaRDI QIDQ2342650
Bart Demoen, Christopher Mears, Maria Garcia de la Banda, Mark G. Wallace
Publication date: 29 April 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-014-9175-5
Related Items (2)
\textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
Uses Software
Cites Work
- Unnamed Item
- Static analysis. 18th international symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings
- Symmetry definitions for constraint satisfaction problems
- On implementing symmetry detection
- Lightweight dynamic symmetry breaking
- Constraint and Integer Programming in OPL
- Dynamic Programming to Minimize the Maximum Number of Open Stacks
- Breaking Symmetry of Interchangeable Variables and Values
- Automatic Detection of Variable and Value Symmetries
- Caching Search States in Permutation Problems
- Automatically Exploiting Subproblem Equivalence in Constraint Programming
- Abstract domains for reordering CLP(RLin) programs
- A Novel Approach For Detecting Symmetries in CSP Models
- Recent Advances in Constraints
- Checking modes of HAL programs
This page was built for publication: A method for detecting symmetries in constraint models and its generalisation
