A reactive and hybrid constraint solver

Monfroy E.; Castro C.; Crawford B.; Soto R.; Paredes F.; Figueroa C.

dc.contributor.author	Monfroy E.
dc.contributor.author	Castro C.
dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Paredes F.
dc.contributor.author	Figueroa C.
dc.date.accessioned	2020-09-02T22:23:31Z
dc.date.available	2020-09-02T22:23:31Z
dc.date.issued	2013
dc.identifier	10.1080/0952813X.2012.656328
dc.identifier.citation	25, 1, 1-22
dc.identifier.issn	0952813X
dc.identifier.uri	https://hdl.handle.net/20.500.12728/5384
dc.description	In Castro et al. [Castro, C., Monfroy, E., Figueroa, C., and Meneses, R. (2005), An Approach for Dynamic Split Strategies in Constraint Solving, in Proceedings of MICAI 2005 (Vol. 3789), LNAI, Berlin: Springer, pp. 162-174] a framework for adaptive enumeration strategies and meta-backtracks for a propagation-based constraint solver has been studied. Here, we extend this framework in order to trigger some functions of a solver, or of a hybrid solver to respond to some observations of the solving process. We can also simply design adaptive hybridisation strategies by just changing some rules of the update component of our framework. We experiment with this framework on a hybrid Branch and Bound + propagation solver in which propagation can be triggered w.r.t. some observations of the solving process. The results show that some phases of propagation are not only beneficial to the Branch and Bound algorithm, but also that propagation is too costly to be executed at each node of the search tree. The hybridisation strategies are thus crucial in order to decide when to perform the or not propagation. © 2013 Copyright Taylor and Francis Group, LLC.
dc.language.iso	en
dc.subject	autonomous search
dc.subject	constraint solving
dc.subject	hybrid solver
dc.subject	reactive search
dc.subject	Autonomous searches
dc.subject	Branch and bounds
dc.subject	Branch-and-bound algorithms
dc.subject	Constraint solvers
dc.subject	Constraint Solving
dc.subject	hybrid solver
dc.subject	Hybridisation
dc.subject	Reactive search
dc.subject	Search trees
dc.subject	Algorithms
dc.subject	Linear programming
dc.subject	Logic programming
dc.title	A reactive and hybrid constraint solver
dc.type	Article