SFB 378 Einstiegsseite Postscript File BibTeX Entry

C
NEP

An Overview of Finite Domain Constraint Programming

Author: Martin Henz and Tobias Müller

Editor:

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.

SFB 378 Einstiegsseite Postscript File BibTeX Entry