Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem

Christian Bessiere (1) , Assef Chmeiss (2) , Lakhdar Saïs (2)

1 COCONUT - Agents, Apprentissage, Contraintes
2 CRIL - Centre de Recherche en Informatique de Lens

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.

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]

Christian Bessiere, Assef Chmeiss, Lakhdar Saïs. Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. 7th International Conference on Principles and Practice of Constraint Programming (CP 2001), Nov 2001, Paphos, Cyprus. pp.565-569, ⟨10.1007/3-540-45578-7_40⟩. ⟨hal-03300268⟩