Constraint satisfaction problems: algorithms and applications

Brailsford, S.C., Potts, C.N. and Smith, B.M. (1998) Constraint satisfaction problems: algorithms and applications. Southampton, UK, University of Southampton (Discussion Papers in Accounting and Management Science, 98-142).


Full text not available from this repository.


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

Item Type: Monograph (Discussion Paper)
Related URLs:
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions : University Structure - Pre August 2011 > School of Management
ePrint ID: 36089
Accepted Date and Publication Date:
Date Deposited: 25 Apr 2007
Last Modified: 31 Mar 2016 12:04

Actions (login required)

View Item View Item