Hybrid strategies of enumeration in constraint solving

dc.contributor.author	Monfroy E.
dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:23:32Z
dc.date.available	2020-09-02T22:23:32Z
dc.date.issued	2011
dc.identifier	10.5897/sre11.891
dc.identifier.citation	6, 21, 4587-4596
dc.identifier.issn	19922248
dc.identifier.uri	https://hdl.handle.net/20.500.12728/5387
dc.description	Enumeration strategies (that is, selection of a variable and a value of its domain) are crucial components of Constraint Programming: they significantly influence the performances of the solving process, sometimes of several orders of magnitude. In this paper, we propose to use Local Search in order to help and guide enumeration: we extend the usual variable selection strategies of constraint programming and we perform the value selection with respect to the results of some local search. The experimental results obtained are rather promising. © 2011 Academic Journals.
dc.language.iso	en
dc.publisher	Academic Journals
dc.subject	Constraint programming
dc.subject	Heuristic search
dc.subject	Hybridization methods
dc.subject	Local search
dc.title	Hybrid strategies of enumeration in constraint solving
dc.type	Article

Repositorio Académico