Skip to Main content Skip to Navigation

Relaxation de contraintes globales : Mise en oeuvre et Application

Jean-Philippe Metivier 1
1 Equipe CODAG - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : In Constraint Programming, global constraints have led to major changes in terms of modeling (synthesizing sets of constraints) and solving (using ltering techniques inherited from other areas such as Operational Research or Artificial Intelligence). Moreover, many real life problems are over-constrained (they have no solution). In this case, it is necessary to soften some constraints. Many studies have been conducted on unary and binary constraints, but very few on global constraints. In this thesis, we study global constraint softening with preferences. We propose different semantics of violation for several global constraints (i.e. AllDifferent,Gcc and Regular). For each softening semantics, we propose algorithms to check consistency and to remove inconsistent values (ltering). The results of this thesis have been successfully applied to Nurse Rostering Problems (NRPs) that are generally over-constrained and very diffcult to solve.
Complete list of metadatas

Cited literature [115 references]  Display  Hide  Download
Contributor : Greyc Référent <>
Submitted on : Tuesday, July 1, 2014 - 3:28:05 PM
Last modification on : Tuesday, February 5, 2019 - 12:12:41 PM
Long-term archiving on: : Wednesday, October 1, 2014 - 12:50:21 PM


  • HAL Id : tel-01016976, version 1


Jean-Philippe Metivier. Relaxation de contraintes globales : Mise en oeuvre et Application. Intelligence artificielle [cs.AI]. Université de Caen, 2010. Français. ⟨tel-01016976⟩



Record views


Files downloads