Constraint Satisfaction Problems: Algorithms and Applications

S.C. Brailsford, C.N. Potts and B.M. Smith

Working Papers from University of Southampton - Department of Accounting and Management Science

Abstract: A constraint satisfaction problem requires a value, selected from a given finite domain, to be assigned to each variable in the problem, so that all constraints relating the variables are satisfied. Many combinatorial problems in operational research, such as schedulling and timetabling, can be formulated as constraint satisfaction problems. Researchers in artificial intelligence usually adopt a constaint satisfaction approach as their prefererd method when tackling such problems. However constraint satisfaction approches are not widely known amongst operational researchers. The aim of this paper is to introduce constraint statisfaction to the operational researchers.

Keywords: PROGRAMMING (search for similar items in EconPapers)
JEL-codes: C60 (search for similar items in EconPapers)
Pages: 39 pages
Date: 1998
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:fth:sotoam:98-142

Ordering information: This working paper can be ordered from
http://www.soton.ac.uk/~econweb/dp/discp.html

Access Statistics for this paper

More papers in Working Papers from University of Southampton - Department of Accounting and Management Science University of Southampton, Department of Accounting & Mangement Science, Southampton S09 5NH UK.. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().