91 search results - page 7 / 19 » Symmetry Breaking Ordering Constraints |
ECAI
2000
Springer
14 years 6 days ago
2000
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...