109 search results - page 9 / 22 » Variable symmetry breaking in numerical constraint problems |
CP
2007
Springer
15 years 4 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...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
IJCAI
2007
14 years 11 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
107
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...