Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CP

2009

Springer

2009

Springer

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...

Related Content

Added |
22 Nov 2009 |

Updated |
22 Nov 2009 |

Type |
Conference |

Year |
2009 |

Where |
CP |

Authors |
Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon |

Comments (0)