Neighborhood-based variable ordering heuristics for the constraint satisfaction problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 565-569

  Bessière, Christian ^a   Chmeiss, Assef ^b   Saïs, Lakhdar ^b  

^a LIRMM   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

BACKTRACKING ALGORITHM; DYNAMIC VARIABLE ORDERING; VARIABLE ORDERING HEURISTICS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947940933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_40     Document Type: Conference Paper

References (6)

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.
3. D. Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22:251–256, 1979.
4. R.M. Haralick and G.L. Elliott. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
5. B. Smith and S.A. Grant. Trying harder to fail first. In Proceedings ECAI’98, pages 249–253, Brighton, UK, 1998.
6. B.M. Smith. The Brélaz heuristic and optimal static orderings. In Proceedings CP’99, pages 405–418, Alexandria VA, 1999.