Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...