# Publication details

##
An Overview of Finite Domain Constraint Programming

Martin Henz, Tobias Müller

Proceedings of the Fifth Conference of
the Association of Asia-Pacific Operational
Research Societies, 2000

In recent years, the repertoire of available techniques for solving combinatorial problems has
seen a significant addition:
constraint programming. Constraint programming is
best seen as a framework for combining software
components to achieve
problem-specific solvers. The strength of
constraint programming depends on the synergy that
can be achieved between these
components. In this tutorial introduction, we give
an overview of constraint programming for solving
combinatorial problems.

Download PDF
Show BibTeX

@INPROCEEDINGS{amai,
title = {An Overview of Finite Domain Constraint Programming},
author = {Martin Henz and Tobias M{\"u}ller},
year = {2000},
booktitle = {Proceedings of the Fifth Conference of
the Association of Asia-Pacific Operational
Research Societies},
address = {{Singapore}},
note = {{to appear}},
}

Login to edit

Webmaster,
Wed Sep 16 10:47:00 2009