IndexBrowse   BibliographiesMy selection
 Search: in   (word length ≥ 3)
Reference no #620   Download bibtex file Type :   Html | Bib | Both
    Created: 2007-12-12 11:30:32
620 Add to my selection
      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 = {},
      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}
Last modified: Thu October 16 2014 19:11:34         BibAdmin