Global Constraints and Filtering Algorithms

Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP. This chapter is an overview of these two techniques. Some of the most frequently used global constraints are presented. In addition, the filtering algorithms establishing arc consistency for two useful constraints, the alldifferent and the global cardinality constraints, are fully detailed. Filtering algorithms are also considered from a theoretical point of view: three different ways to design filtering algorithms are described and the quality of the filtering algorithms studied so far is discussed. A categorization is then proposed. Over-constrained problems are also mentioned and global soft constraints are introduced.

[1]  Christian Bessiere,et al.  New Lower Bounds of Constraint Violations for Over-Constrained Problems , 2001, CP.

[2]  Kurt Mehlhorn,et al.  Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint , 2000, CP.

[3]  François Laburthe,et al.  Solving Various Weighted Matching Problems with Constraints , 1997, Constraints.

[4]  Jianyang Zhou,et al.  A Constraint Program for Solving the Job-Shop Problem , 1996, CP.

[5]  Christian Bessiere,et al.  Specific Filtering Algorithms for Over-Constrained Problems , 2001, CP.

[6]  Jean-Charles Régin.  The Symmetric Alldiff Constraint , 1999, IJCAI.

[7]  A. Colmerauer,et al.  Narrowing a 2n-block of sortings in O (n logn) , 1997 .

[8]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[9]  Thomas Schiex,et al.  Reversible DAC and Other Improvements for Solving Max-CSP , 1998, AAAI/IAAI.

[10]  Jean-François Puget,et al.  A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.

[11]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[12]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[13]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[14]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[15]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[16]  Jean-Charles Régin,et al.  A Global Constraint Combining a Sum Constraint and Difference Constraints , 2000, CP.

[17]  Yves Caseau,et al.  A deductive and object-oriented approach to a complex scheduling problem , 2004, Journal of Intelligent Information Systems.

[18]  Nicolas Beldiceanu.  Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family , 2001, CP.

[19]  Jean-Charles Régin,et al.  A Filtering Algorithm for Global Sequencing Constraints , 1997, CP.

[20]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[21]  Jean-Charles Régin,et al.  Arc Consistency for Global Cardinality Constraints with Costs , 1999, CP.

[22]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..

[23]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[24]  Qi Guo,et al.  Non-overlapping Constraints between Convex Polytopes , 2001, CP.

[25]  Christian Bessiere,et al.  Meta-constraints on violations for over constrained problems , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[26]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[27]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[28]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[29]  Mats Carlsson,et al.  A New Multi-resource cumulatives Constraint with Negative Heights , 2002, CP.

[30]  K. McAloon,et al.  Sports League Scheduling , 1997 .

[31]  Toby Walsh,et al.  The Difference All-Difference Makes , 1999, IJCAI.

[32]  Jean-Charles Régin,et al.  Cost-Based Arc Consistency for Global Cardinality Constraints , 2002, Constraints.

[33]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[34]  Philippe Baptiste,et al.  Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints , 1998, CP.

[35]  Peter Damaschke,et al.  Domination in Convex and Chordal Bipartite Graphs , 1990, Inf. Process. Lett..

[36]  Christian Bessiere,et al.  An Original Constraint Based Approach for Solving over Constrained Problems , 2000, CP.

[37]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[38]  Martin Henz,et al.  Global constraints for round robin tournament scheduling , 2004, Eur. J. Oper. Res..

[39]  N. Guernalec,et al.  Narrowing a 2 n -block of sortings in O ( n log n ) , 1997 .

[40]  Gilles Pesant,et al.  A Filtering Algorithm for the Stretch Constraint , 2001, CP.

[41]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[42]  Christian Bessiere,et al.  Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly , 1999, CP.

[43]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[44]  Christian Bessiere,et al.  Range-Based Algorithm for Max-CSP , 2002, CP.

[45]  Pascal Van Hentenryck,et al.  Constraint Programming in OPL , 1999, PPDP.

[46]  Pascal Van Hentenryck,et al.  The Cardinality Operator: A New Logical Connective for Constraint Logic Programming , 1990, WCLP.