Skip to Main content Skip to Navigation
Conference papers

Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem

Christian Bessière 1 Assef Chmeiss 2 Lakhdar Saïs 2
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03300268
Contributor : Fabien Delorme <>
Submitted on : Wednesday, July 28, 2021 - 11:27:05 AM
Last modification on : Thursday, September 9, 2021 - 3:10:48 PM

File

ark__67375_HCB-35NLZ0WX-2.pdf
Files produced by the author(s)

Identifiers

Citation

Christian Bessière, 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⟩

Share

Metrics

Record views

13

Files downloads

22