 |
 |
 |
 |
|
|
|
|
| HAL : hal-00517141, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
| IEEE-ICTAI, 22th International Conference on Tools with Artificial Intelligence, Arras : France (2010) |
|
|
|
|
| The Ordered Distribute Constraint |
|
|
| Thierry Petit 1, 2Jean-Charles Régin 3 |
|
|
| (26/10/2010) |
|
|
|
| In this paper we introduce a new cardinality constraint: ORDEREDDISTRIBUTE. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not consider at the same time the occurrences of all the values greater than v. We design an algorithm for achieving generalized arc-consistency on ORDEREDDISTRIBUTE, with a time complexity linear in the sum of the number of variables and the number of values in the union of their domains. In addition, we give some experiments showing the advantage of this new constraint for problems where values represent levels whose overrunning has to be under control. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Nantes Atlantique (LINA) |
|
|
|
CNRS : UMR6241 – Université de Nantes – École Nationale Supérieure des Mines - Nantes |
|
|
| 2 : | LINA |
|
|
|
École Nationale Supérieure des Mines - Nantes |
|
|
| 3 : | Université Nice Sophia Antipolis (UNS) |
|
|
|
Université Nice Sophia Antipolis [UNS] – PRES Euro-Méditerranéen |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Recherche opérationnelle Informatique/Intelligence artificielle |
|
|
| Constraint Programming – Global Constraints – Optimization Problems |
|
| hal-00517141, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00517141 | |
| oai:hal.archives-ouvertes.fr:hal-00517141 | |
| Contributeur : Thierry Petit | |
| Soumis le : Lundi 13 Septembre 2010, 15:50:46 | |
| Dernière modification le : Lundi 13 Septembre 2010, 15:50:46 | |
