%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:15 +0100 GMT
%    
% Selection : Reference #620
%




@InProceedings{Henz_Müller:2000,
      AUTHOR = {Henz, Martin and Müller, Tobias},
      TITLE = {An Overview of Finite Domain Constraint Programming},
      YEAR = {2000},
      BOOKTITLE = {5th Conference of the Association of Asia-Pacific Operations Research Societies (APORS '00), July 5-7},
      ADDRESS = {Singapore, Republic of Singapore},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/amai2000.ps.gz},
      ABSTRACT = {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.},
      ANNOTE = {COLIURL : Henz:2000:OFD.pdf Henz:2000:OFD.ps}
}