Constraint satisfaction problems are ubiquitous. A simple example that we will use throughout the first half of this chapter is the following scheduling problem: Choose employees A or B for each of three tasks, X, Y, Z, subject to the work rules that the same employee cannot carry out both tasks X and Y, the same employee cannot carry out both tasks Y and Z, and only employee B is allowed to carry out task Z. (Many readers will recognize this as a simple coloring problem.).
CITATION STYLE
Freuder, E. C., & Wallace, M. (2014). Constraint programming. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Second Edition (pp. 369–402). Springer US. https://doi.org/10.1007/978-1-4614-6940-7_14
Mendeley helps you to discover research relevant for your work.