Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib...
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...