113 search results - page 17 / 23 » Symmetry Breaking |
CPAIOR
2005
Springer
15 years 3 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...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
AAAI
2004
14 years 11 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
PR
2000
14 years 9 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
ANOR
2011
14 years 4 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...