Constraint Programming

Eugene C. Freuder and Mark Wallace
Additional contact information
Eugene C. Freuder: University College Cork
Mark Wallace: Monash University

Chapter Chapter 9 in Search Methodologies, 2005, pp 239-272 from Springer

Abstract: 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.)

Keywords: Constraint Satisfaction; Constraint Programming; Constraint Satisfaction Problem; Global Constraint; Constraint Network (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-28356-2_9

Ordering information: This item can be ordered from
http://www.springer.com/9780387283562

DOI: 10.1007/0-387-28356-0_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().