Abstract
This paper considers feasibility checking and filtering of global constraints over set variables. It makes four main contributions. (1) It presents a feasibility checker for the global alldisjoint constraint. (2) It proposes primal filters for the combination of a global disjoint constraint and symmetry-breaking constraints. (3) It proposes dual filters for global intersection constraints. (4) It presents primal/dual filters for the combination of a global intersection constraint and symmetry-breaking constraints. All these contributions are independent of the underlying domain representation. Experimental results show that these proposals have complementary benefits, may improve efficiency significantly, and make it possible to solve larger instances of two standard benchmarks. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Yip, J., & Van Hentenryck, P. (2011). Checking and filtering global set constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6876 LNCS, pp. 819–833). https://doi.org/10.1007/978-3-642-23786-7_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
