Publication details

Saarland University Computer Science

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               

Login to edit

Legal notice, Privacy policy