A dynamic constraint programming approach

Eric Monfroy, Carlos Castro, Broderick Crawford

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed to dynamically change strategies showing bad performances, and to use metabacktrack to restore better states when bad decisions were made. In this work, we design and evaluate strategies to improve resolution performances of a set of problems.

Original languageEnglish
Title of host publicationCutting-Edge Research Topics on Multiple Criteria Decision Making
Subtitle of host publication20th International Conference, MCDM 2009, Chengdu/Jiuzhaigou, Proceedings
Pages653-656
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes

Publication series

NameCommunications in Computer and Information Science
Volume35
ISSN (Print)1865-0929

Fingerprint

Dive into the research topics of 'A dynamic constraint programming approach'. Together they form a unique fingerprint.

Cite this