Interleaving constraint propagation: An efficient cooperative search with branch and bound
MetadataShow full item record
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. © 2013 Springer-Verlag.
Showing items related by title, author, creator and subject.
Conference PaperMonfroy E.; Crawford B.; Soto R. (2013)
ArticleMonfroy E.; Castro C.; Crawford B.; Soto R.; Paredes F.; Figueroa C. (2013)
Conference PaperCrawford B.; Soto R.; Johnson F.; Monfroy E.; Norero E.; Olguín E. (Springer Verlag, 2015)