Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
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.
Unable to display preview. Download preview PDF.
- 1.C. Bessiére, A. Chmeiss, and L. Saïs. Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. Technical Report 01002, LIRMM-University of Montpelllier II, Montpellier, France, January 2001. (available at http://www.lirmm.fr/~bessiere/).
- 2.C. Bessiére and J.C. Régin. MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings CP’96, pages 61–75, Cambridge MA, 1996.Google Scholar
- 5.B. Smith and S.A. Grant. Trying harder to fail first. In Proceedings ECAI’98, pages 249–253, Brighton, UK, 1998.Google Scholar
- 6.B.M. Smith. The Brélaz heuristic and optimal static orderings. In Proceedings CP’99, pages 405–418, Alexandria VA, 1999.Google Scholar