Constraint programming

Eugene C. Freuder; Mark Wallace

doi:10.1007/978-1-4614-6940-7_14

Constraint programming

Eugene C. Freuder, Mark Wallace

Research output: Chapter in Book/Report/Conference proceeding › Chapter (Book) › Other › peer-review

3 Citations (Scopus)

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
Editors	Edmund K. Burke, Graham Kendall
Place of Publication	New York, New York
Publisher	Springer
Pages	369-401
Number of pages	33
Edition	Second Edition
ISBN (Electronic)	9781461469407
ISBN (Print)	9781461469391
DOIs	https://doi.org/10.1007/978-1-4614-6940-7_14
Publication status	Published - 1 Jan 2014

Access to Document

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

Cite this

@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 = jan,

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",

}

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)

AN - SCOPUS:84956520013

SN - 9781461469391

SP - 369

EP - 401

BT - Search Methodologies

A2 - Burke, Edmund K.

A2 - Kendall, Graham

PB - Springer

CY - New York, New York

ER -

Constraint programming

Abstract

Access to Document

Other files and links

Cite this