Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/200933
Title: An Overview of Finite Domain Constraint Programming
Authors: Henz, M 
Muller, T 
Keywords: Constraint programming
combinatorial search
tree search
Issue Date: 2000
Citation: Henz, M, Muller, T (2000). An Overview of Finite Domain Constraint Programming. ScholarBank@NUS Repository.
Abstract: In recent years, the repertoire of available techniques for solving combinatorial problems has seen a significant ant addition: finite domain constraint programming. This technique is best seen as a framework for combining software components to a achieve problem-specific tree search. Its strength depends on the synergy that an be a achieved between these components. In this paper, we give an overview of constraint programming for solving combinatorial problems. We focus on practical aspects and highlight connections to Operations Research techniques and their applications.
URI: https://scholarbank.nus.edu.sg/handle/10635/200933
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
overview.pdf178.77 kBAdobe PDF

OPEN

Post-printView/Download

Page view(s)

22
checked on Dec 2, 2021

Download(s)

1
checked on Dec 2, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.