The Brélaz heuristic and optimal static orderings

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

Volumn 1713, Issue , 1999, Pages 405-418

  Smith, Barbara M ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; TREES (MATHEMATICS);

ALL SOLUTIONS; BACKTRACKING SEARCH ALGORITHMS; CONSTRAINT GRAPH; DYNAMIC VARIABLE ORDERING; FORWARD CHECKING; OPTIMAL ORDERING; SEARCH COSTS; STATIC ORDERING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957353316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_29     Document Type: Conference Paper

References (10)

1. C. Bessière and J.-C. Régin. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In E. C. Freuder, editor, Principles and Practice of Constraint Programming - CP96, LNCS 1118, pages 61–75. Springer, 1996.
2. D. Brélaz. New Methods to Color the Vertices of a Graph. Communications of the ACM, 22:251–256, 1979.
3. R. Dechter and I. Meiri. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In Proceedings IJCAI-89, volume 1, pages 271–277, 1989.
4. D. Frost and R. Dechter. In search of the best constraint satisfaction search. In Proceedings AAAI’94, pages 301–306, 1994.
5. I. Gent, E. MacIntyre, P. Prosser, B. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In E. C. Freuder, editor, Principles and Practice of Constraint Programming - CP96, LNCS 1118, pages 179–193. Springer-Verlag, 1996.
6. R. Haralick and G. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
7. B. Nudel. Consistent-labelling problems and their algorithms: Expectedcomplexities and theory-based heuristics. Artificial Intelligence, 21:135–178, 1983.
8. P. Prosser. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3):268–299, 1993.
9. D. Sabin and E. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. In A. Cohn, editor, Proceedings ECAI94, pages 125–129, 1994.
10. B. M. Smith and S. A. Grant. Trying Harder to Fail First. In H. Prade, editor, Proceedings ECAI’98, pages 249–253. Wiley, Aug. 1998.