Constraint programming

Eugene C. Freuder, Mark Wallace

    Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Otherpeer-review

    3 Citations (Scopus)


    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 languageEnglish
    Title of host publicationSearch Methodologies
    Subtitle of host publicationIntroductory Tutorials in Optimization and Decision Support Techniques
    EditorsEdmund K. Burke, Graham Kendall
    Place of PublicationNew York, New York
    Number of pages33
    EditionSecond Edition
    ISBN (Electronic)9781461469407
    ISBN (Print)9781461469391
    Publication statusPublished - 1 Jan 2014

    Cite this