Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem - Université d'Artois Access content directly
Conference Papers Year : 2001

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem

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.
Fichier principal
Vignette du fichier
ark__67375_HCB-35NLZ0WX-2.pdf (579.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03300268 , version 1 (28-07-2021)

Identifiers

Cite

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⟩
56 View
69 Download

Altmetric

Share

Gmail Facebook X LinkedIn More