41 search results - page 1 / 9 » Automatically Exploiting Symmetries in Constraint Programmin... |
CSCLP
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
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...
CP
2007
Springer
13 years 11 months ago
2007
Springer
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
In many algorithms, particularly those in the DSP domain, certain forms of symmetry can be observed. To efficiently implement such algorithms, it is often possible to exploit thes...