TY - GEN
T1 - Interleaving constraint propagation
T2 - 8th International Workshop on Hybrid Metaheuristics, HM 2013
AU - Monfroy, Eric
AU - Crawford, Broderick
AU - Soto, Ricardo
PY - 2013
Y1 - 2013
N2 - The main characteristic of any constraint solver is Constraint propagation. Then it is very important to be able to manage constraint propagation as efficiently as possible, we present a hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to reduce the search space. Based on some observations of the solving process constraint propagation is triggered by some rules. The results show that constraint propagation is profitable, but also that it is too costly to be executed at each node of the search tree, we show that is possible to make reasonable use of constraint propagation.
AB - The main characteristic of any constraint solver is Constraint propagation. Then it is very important to be able to manage constraint propagation as efficiently as possible, we present a hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to reduce the search space. Based on some observations of the solving process constraint propagation is triggered by some rules. The results show that constraint propagation is profitable, but also that it is too costly to be executed at each node of the search tree, we show that is possible to make reasonable use of constraint propagation.
UR - http://www.scopus.com/inward/record.url?scp=84883030287&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-38516-2_5
DO - 10.1007/978-3-642-38516-2_5
M3 - Conference contribution
AN - SCOPUS:84883030287
SN - 9783642385155
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 52
EP - 61
BT - Hybrid Metaheuristics - 8th International Workshop, HM 2013, Proceedings
Y2 - 23 May 2013 through 25 May 2013
ER -