Softening Gcc and Regular with preferences
Résumé
In this paper, we present the soft global constraints -gcc and -regular which are the soft versions with preferences of well-known global constraints Gcc and Regular. For each of them, we introduce a new violation based semantic which takes into account preferences and propose algorithms to enforce hyperarc consistency in polynomial time, making use of flow theory.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|