The Ordered Distribute Constraint

Thierry Petit 1 Jean-Charles Régin 2
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Type de document :
Communication dans un congrès
IEEE-ICTAI, 22th International Conference on Tools with Artificial Intelligence, Oct 2010, Arras, France. pp.000, 2010
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00517141
Contributeur : Thierry Petit <>
Soumis le : lundi 13 septembre 2010 - 15:50:46
Dernière modification le : mercredi 9 septembre 2015 - 01:04:47

Identifiants

  • HAL Id : hal-00517141, version 1

Collections

Citation

Thierry Petit, Jean-Charles Régin. The Ordered Distribute Constraint. IEEE-ICTAI, 22th International Conference on Tools with Artificial Intelligence, Oct 2010, Arras, France. pp.000, 2010. <hal-00517141>

Partager

Métriques

Consultations de la notice

116