Article ID: | iaor20032978 |
Country: | United States |
Volume: | 13 |
Issue: | 2 |
Start Page Number: | 96 |
End Page Number: | 103 |
Publication Date: | Apr 2001 |
Journal: | INFORMS Journal On Computing |
Authors: | Williams H.P., Yan Hong |
Keywords: | constraint programming |
The use of predicates to state constraints in Constraint Satisfaction is explained. If, as an alternative, the traditional approach of Integer Programming (IP) is used, it is desirable to model these constraints so as to give as tight a linear programming relaxation as possible. One of the most commonly used predicates is the