Beldiceanu, Nicolas (2001) *Pruning for the minimum constraint family and for the number of distinct values constraint family.* In: Principles and Practice of Constraint Programming (CP 2001): 7th International Conference, 26 Nov -1 Dec 2001, Paphos, Cyprus.

Full text not available from this repository.

Official URL: doi:10.1007/3-540-45578-7_15

## Abstract

The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as time tabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint "at most n distinct values for a set of variables". This can be considered as the counterpart of Regin's algorithm for the all different constraint where one enforces having at least n distinct values for a given set of n variables.

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Additional Information: | Lecture notes in computer science; 2239. |

ID Code: | 3066 |

Deposited By: | INVALID USER |

Deposited On: | 15 Jul 2008 |

Last Modified: | 18 Nov 2009 16:17 |

Repository Staff Only: item control page