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.
Cite
CITATION STYLE
Bessière, C., Chmeiss, A., & Saïs, L. (2001). Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 565–569). Springer Verlag. https://doi.org/10.1007/3-540-45578-7_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
