Show simple item record

dc.contributor.authorMonfroy E.
dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:23:32Z
dc.date.available2020-09-02T22:23:32Z
dc.date.issued2011
dc.identifier10.5897/sre11.891
dc.identifier.citation6, 21, 4587-4596
dc.identifier.issn19922248
dc.identifier.urihttps://hdl.handle.net/20.500.12728/5387
dc.descriptionEnumeration 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.isoen
dc.publisherAcademic Journals
dc.subjectConstraint programming
dc.subjectHeuristic search
dc.subjectHybridization methods
dc.subjectLocal search
dc.titleHybrid strategies of enumeration in constraint solving
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record