97 search results - page 7 / 20 » Symmetry Breaking in Constraint Programming |
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
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...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
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 ...
CP
2004
Springer
14 years 1 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
CP
2007
Springer
14 years 2 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...