Constraint programming

Eugene C. Freuder, Mark Wallace

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

    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 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
    PublisherSpringer
    Pages369-401
    Number of pages33
    EditionSecond Edition
    ISBN (Electronic)9781461469407
    ISBN (Print)9781461469391
    DOIs
    Publication statusPublished - 1 Jan 2014

    Cite this

    Freuder, E. C., & Wallace, M. (2014). Constraint programming. In E. K. Burke, & G. Kendall (Eds.), Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (Second Edition ed., pp. 369-401). New York, New York: Springer. https://doi.org/10.1007/978-1-4614-6940-7_14
    Freuder, Eugene C. ; Wallace, Mark. / Constraint programming. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques . editor / Edmund K. Burke ; Graham Kendall. Second Edition. ed. New York, New York : Springer, 2014. pp. 369-401
    @inbook{a10c65138df446d4ba90c8cba3a50dba,
    title = "Constraint programming",
    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.).",
    author = "Freuder, {Eugene C.} and Mark Wallace",
    year = "2014",
    month = "1",
    day = "1",
    doi = "10.1007/978-1-4614-6940-7_14",
    language = "English",
    isbn = "9781461469391",
    pages = "369--401",
    editor = "Burke, {Edmund K.} and Graham Kendall",
    booktitle = "Search Methodologies",
    publisher = "Springer",
    edition = "Second Edition",

    }

    Freuder, EC & Wallace, M 2014, Constraint programming. in EK Burke & G Kendall (eds), Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques . Second Edition edn, Springer, New York, New York, pp. 369-401. https://doi.org/10.1007/978-1-4614-6940-7_14

    Constraint programming. / Freuder, Eugene C.; Wallace, Mark.

    Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques . ed. / Edmund K. Burke; Graham Kendall. Second Edition. ed. New York, New York : Springer, 2014. p. 369-401.

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

    TY - CHAP

    T1 - Constraint programming

    AU - Freuder, Eugene C.

    AU - Wallace, Mark

    PY - 2014/1/1

    Y1 - 2014/1/1

    N2 - 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.).

    AB - 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.).

    UR - http://www.scopus.com/inward/record.url?scp=84956520013&partnerID=8YFLogxK

    U2 - 10.1007/978-1-4614-6940-7_14

    DO - 10.1007/978-1-4614-6940-7_14

    M3 - Chapter (Book)

    SN - 9781461469391

    SP - 369

    EP - 401

    BT - Search Methodologies

    A2 - Burke, Edmund K.

    A2 - Kendall, Graham

    PB - Springer

    CY - New York, New York

    ER -

    Freuder EC, Wallace M. Constraint programming. In Burke EK, Kendall G, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques . Second Edition ed. New York, New York: Springer. 2014. p. 369-401 https://doi.org/10.1007/978-1-4614-6940-7_14