The University of Southampton
University of Southampton Institutional Repository

Constraint satisfaction problems: algorithms and applications

Constraint satisfaction problems: algorithms and applications
Constraint satisfaction problems: algorithms and applications
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 scheduling and timetabling, can be formulated as constraint satisfaction problems. Researchers in artificial intelligence usually adopt a constraint satisfaction approach as their preferered method when tackling such problems. However constraint satisfaction approaches are not widely known amongst operational researchers. The aim of this paper is to introduce constraint satisfaction to the operational researchers.
98-142
University of Southampton
Brailsford, S.C.
634585ff-c828-46ca-b33d-7ac017dda04f
Potts, C.N.
8b5c163b-0741-4cd0-96fd-8a43ee10f30b
Smith, B.M.
ad9c9ada-3609-4ef7-ae5e-9c2eb33b5c0f
Brailsford, S.C.
634585ff-c828-46ca-b33d-7ac017dda04f
Potts, C.N.
8b5c163b-0741-4cd0-96fd-8a43ee10f30b
Smith, B.M.
ad9c9ada-3609-4ef7-ae5e-9c2eb33b5c0f

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

Record type: Monograph (Discussion Paper)

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 scheduling and timetabling, can be formulated as constraint satisfaction problems. Researchers in artificial intelligence usually adopt a constraint satisfaction approach as their preferered method when tackling such problems. However constraint satisfaction approaches are not widely known amongst operational researchers. The aim of this paper is to introduce constraint satisfaction to the operational researchers.

This record has no associated files available for download.

More information

Published date: 1998

Identifiers

Local EPrints ID: 36089
URI: http://eprints.soton.ac.uk/id/eprint/36089
PURE UUID: 10e4fb40-4039-4e5c-9127-e3dcd683dd9e
ORCID for S.C. Brailsford: ORCID iD orcid.org/0000-0002-6665-8230

Catalogue record

Date deposited: 25 Apr 2007
Last modified: 12 Dec 2021 02:42

Export record

Contributors

Author: S.C. Brailsford ORCID iD
Author: C.N. Potts
Author: B.M. Smith

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×