Bounded backtracking for the valued constraint satisfaction problems

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

Volumn 2833, Issue , 2003, Pages 709-723

  Terrioux, Cyril ^a   Jégou, Philippe ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPLEX NETWORKS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; FORESTRY; TREES (MATHEMATICS);

CLASSICAL DYNAMICS; CONSTRAINT NETWORKS; ENUMERATIVE ALGORITHMS; NATURAL EXTENSION; OPTIMAL BOUNDS; TIME COMPLEXITY; TREE DECOMPOSITION; VALUED CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248868696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_48     Document Type: Article

References (21)

1. P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146:43-75, 2003.
2. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992.
3. th IJCAI, pages 624-630, 1995.
4. th IJCAI, pages 631-637, 1995.
5. P. Dago and G. Verfaillie. Nogood Recording for Valued Constraint Satisfaction Problems. In Proc. of ICTAI 96, pages 132-139, 1996.
6. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107(1):149-163, 1999.
7. T. Schiex. Une comparaison des cohérences d'arc dans les Max-CSP. In Actes des JNPC'2002, pages 209-223, 2002. In french.
8. J. Larrosa. On arc and node consistency. In Proc. of AAAI, 2002.
9. th AAAI, pages 181-187, 1996.
10. A. Koster. Frequency Assignment - Models and Algorithms. PhD thesis, University of Maastricht, November 1999.
11. R. Dechter and J. Pearl. Tree-Clustering for Constraint Networks. Artificial Intelligence, 38:353-366, 1989.
12. R. Dechter and Y. El Fattah. Topological Parameters for Time-Space Tradeoff. Artificial Intelligence, 125:93-118, 2001.
13. N. Robertson and P.D. Seymour. Graph minors II: Algorithmic aspects of tree-width. Algorithms, 7:309-322, 1986.
14. S. Arnborg, D. Corneil, and A. Proskuroswki. Complexity of finding embedding in a k-tree. SIAM Journal of Discrete Mathematics, 8:277-284, 1987.
15. A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence, 125:3-17, 2001.
16. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124:343-282, 2000.
17. P. Meseguer and M. Sánchez. Tree-based Russian Doll Search. In Proc. of Workshop on soft constraint. CP'2000, 2000.
18. th ECAI, pages 131-135, 2002.
19. R. Wallace. Directed arc consistency preprocessing. In Proc. of the ECAI-94 Workshop on Constraint Processing, LNCS 923, pages 121-137, 1994.
20. R. Wallace. Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem. In Proc. of AAAI, pages 188-195, 1996.
21. nd CP, pages 308-322, 1996.