Solving Necklace Constraint Problems

8 years 4 months ago
Solving Necklace Constraint Problems
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 be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of these combinatorial objects, and constraint programming, where the requisite symmetry breaking has at best been done statically so far. We design the first search procedure and identify the first symmetrybreaking constraints for the general case of unlabelled necklaces. Further, we compare dynamic and static symmetry breaking on reallife scheduling problems featuring (unlabelled) necklaces.
Pierre Flener, Justin Pearson
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where ECAI
Authors Pierre Flener, Justin Pearson
Comments (0)