TY - GEN
T1 - A dynamic constraint programming approach
AU - Monfroy, Eric
AU - Castro, Carlos
AU - Crawford, Broderick
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=68349159071&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02298-2_96
DO - 10.1007/978-3-642-02298-2_96
M3 - Conference contribution
AN - SCOPUS:68349159071
SN - 9783642022975
T3 - Communications in Computer and Information Science
SP - 653
EP - 656
BT - Cutting-Edge Research Topics on Multiple Criteria Decision Making
PB - Springer Verlag
ER -