Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

Constraints

Volumn 8, Issue 3, 2003, Pages 303-326

  Larrosa, Javier ^a   Dechter, Rina ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Branch and bound; Bucket elimination; Constraint optimization; Constraint satisfaction; Soft constraints

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; STRUCTURAL OPTIMIZATION;

BUCKET ELIMINATION METHODS;

CONSTRAINT THEORY;

EID: 0041781747     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025627211942     Document Type: Conference Paper

References (27)

1. Arnborg, S. A. (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25: 2-23.
2. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press.
3. Bessiére, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1): 179-190.
4. Bessière, C., & Regin, J.-C. (1996). MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of the 2nd CP, pages 61-75, Alexandria, USA.
5. Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2): 201-236.
6. Cabon, B., de Givry, S., Lobjois, L., Schiex, T., & Warners, J. P. (1999). Radio link frequency assignment. Constraints, 4: 79-89.
7. Dechter, R. (1990). Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence, 41: 273-312.
8. Dechter, R. (1999). Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113: 41-85.
9. Dechter, R., Kask, K., & Larrosa, J. (2001). A general scheme for multiple lower bound computation in constraint optimization. In Proceedings of the 7th CP, pages 346-360.
10. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38: 353-366.
11. Dechter, R., & Rish, I. (1997). A scheme for approximating probabilistic inference. In Proceedings of the 13th UAI-97, pages 132-141. San Francisco: Morgan Kaufmann Publishers.
12. Dechter, R., & van Seek, P. (1997). Local and global relational consistency. Theoretical Computer Science, 173(1): 283-308.
13. Freuder, E. C., & Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58: 21-70.
14. Frost D., & Dechter, R. (1994). In search of the best constraint satisfaction search. In Proceedings of the 12th AAAI, pages 301-306.
15. Haralick, R. M., & Elliott, O. L. (1980). Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263-313.
16. Kask, K., & Dechter, R. (2001). A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129: 91-131.
17. Larrosa, J. (2000). Boosting search with variable elimination. In Proc. of the 6th CP, LNCS, pages 291-305. Singapore: Springer Verlag.
18. Larrosa, J. (2002). Node and arc consistency in weighted CSP. In Proceedings of the 18th AAAI.
19. Larrosa, J., Meseguer, P., & Schiex, T. (1999). Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107(1): 149-163.
20. Lawler, E. L., & Wood, D. E. (1966). Branch-and-bound methods: a survey. Operations Research, 14(4): 699-719.
21. Meseguer, P., Larrosa, J., & Sanchez, M. (2001). Lower bounds for non-binary constraint optimization problems. Proceedings of the 7th CP, pages 317-331.
22. Nudel, B. (1988). Tree search and arc consistency in constraint satisfaction algorithms. Search in Artificial Intelligence, 999: 287-342.
23. Rish, I., & Dechter, R. (2000). Resolution vs. SAT: two approaches to SAT. Journal of Automated Reasoning, 24(1): 225-275.
24. Schiex, T. (2000). Arc consistency for soft constraints. In Proceedings of the 6th CP, Singapore, pages 411-424.
25. Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: hard and easy problems. In IJCAI-95, pages 631-637. Montréal, Canada.
26. Smith, B. (1994). Phase transition and the mushy region in constraint satisfaction. In Proceedings of the 11th ECAI, pages 100-104.
27. Verfaillie, G., Lemaître, M., & Schiex, T. (1996). Russian doll search. In AAAI-96, pages 181-187, Portland, OR.