Interleaving constraint propagation: An efficient cooperative search with branch and bound

Monfroy E.; Crawford B.; Soto R.

dc.contributor.author	Monfroy E.
dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.date.accessioned	2020-09-02T22:23:32Z
dc.date.available	2020-09-02T22:23:32Z
dc.date.issued	2013
dc.identifier	10.1007/978-3-642-38516-2_5
dc.identifier.citation	7919 LNCS, , 52-61
dc.identifier.issn	03029743
dc.identifier.uri	https://hdl.handle.net/20.500.12728/5386
dc.description	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.
dc.language.iso	en
dc.title	Interleaving constraint propagation: An efficient cooperative search with branch and bound
dc.type	Conference Paper