| Article ID: | iaor20073058 |
| Country: | France |
| Volume: | 40 |
| Issue: | 4 |
| Start Page Number: | 327 |
| End Page Number: | 353 |
| Publication Date: | Oct 2006 |
| Journal: | RAIRO Operations Research |
| Authors: | Beldiceanu Nicolas, Petit Thierry, Rochart Guillaume |
| Keywords: | programming: network |
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.