Abstract
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.)
| Original language | English |
|---|---|
| Title of host publication | Search Methodologies |
| Subtitle of host publication | Introductory Tutorials in Optimization and Decision Support Techniques |
| Publisher | Springer Verlag |
| Pages | 239-272 |
| Number of pages | 34 |
| ISBN (Print) | 0387234608, 9780387234601 |
| DOIs | |
| Publication status | Published - 2005 |