Hybrid strategies of enumeration in constraint solving | Zendy

Éric Monfroy | Zendy; Broderick Crawford | Zendy; Ricardo Soto | Zendy; Fern | Zendy; o Paredes | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hybrid strategies of enumeration in constraint solving

Author(s) -

Éric Monfroy,

Broderick Crawford,

Ricardo Soto,

Fern,

o Paredes

Publication year - 2011

Publication title -

scientific research and essays

Language(s) - English

Resource type - Journals

ISSN - 1992-2248

DOI - 10.5897/sre11.891

Subject(s) - enumeration , constraint (computer aided design) , heuristic , constraint programming , selection (genetic algorithm) , computer science , mathematical optimization , variable (mathematics) , local search (optimization) , domain (mathematical analysis) , process (computing) , value (mathematics) , mathematics , artificial intelligence , machine learning , stochastic programming , mathematical analysis , geometry , combinatorics , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research