Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
| |
|
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
Christian Bessiére5  , Assef Chmeiss6 and Lakhdar Saïs6
| (5) |
LIRMM-CNRS (UMR 5506), Member of the Coconut group, 161, rue Ada, 34392 Montpellier Cedex 5, France |
| (6) |
CRIL, Université d’Artois - IUT de Lens, Rue de l’université - SP 16, 62307 LENS Cedex, France |
Abstract
One of the key factors in the efficiency of backtracking algorithms is the rule they use to decide on which variable to branch
next (namely, the variable ordering heuristics). In this paper, we give a formulation of dynamic variable ordering heuristics
that takes into account the properties of the neighborhood of the variable.
This work was partially supported by the IUT of Lens, the Nord/PasdeCalais region, and the European community.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|