Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
We identify a new and important global (or nonbinary) constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This const...
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahi...
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...