Hebrard, E. and Marx, D. and O’Sullivan, B. and Razgon, Igor (2009) Constraints of difference and equality: a complete taxonomic characterisation. In: Gent, I.P. (ed.) Principles and Practice of Constraint Programming - CP 2009. Lecture Notes in Computer Science 5732. Berlin, Germany: Springer Verlag, pp. 424-438. ISBN 9783642042447.
Abstract
Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, in particular, ensures that all variables take distinct values. Two soft variants of this constraint were proposed in [4], defined either with respect to a so-called variable or graph-based cost function. When requiring similarity, as opposed to diversity, one can consider the dual definition either for the cost or for the basic constraint itself, that is, AllEqual in our case. Six cost functions can be defined by exploring every combination of these definitions. It is therefore natural to study the complexity of achieving arc consistency and bounds consistency on them. From our earlier work on this topic an open problem remained, namely achieving bounds consistency on the maximisation of the SoftAllDiff constraint when considering the graph-based cost. In this paper we resolve this problem. Therefore, we give a complete taxonomy of constraints of equality and difference, based on the alternative objective functions used for the soft variants.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 01 Aug 2013 15:30 |
| Last Modified: | 09 Aug 2023 12:34 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7920 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
