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.
This work was partially supported by the IUT of Lens, the Nord/PasdeCalais region, and the European community.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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/).
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.
D. Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22:251–256, 1979.
R.M. Haralick and G.L. Elliott. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
B. Smith and S.A. Grant. Trying harder to fail first. In Proceedings ECAI’98, pages 249–253, Brighton, UK, 1998.
B.M. Smith. The Brélaz heuristic and optimal static orderings. In Proceedings CP’99, pages 405–418, Alexandria VA, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bessiére, C., Chmeiss, A., Saïs, L. (2001). Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_40
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive