A general scheme for multiple lower bound computation in constraint optimization

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

Volumn 2239, Issue , 2001, Pages 346-360

  Dechter, Rina ^a   Kask, Kalev ^a   Larrosa, Javier ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; COST EFFECTIVENESS; ECONOMIC AND SOCIAL EFFECTS;

ARBITRARY SETS; BRANCH-AND-BOUND ALGORITHMS; CONSTRAINT OPTIMIZATIONS; COST EFFECTIVE; DYNAMIC VARIABLES; LOWER BOUNDS; SEARCH SPACES; TRADE OFF;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (23)

1. [1] S.A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25:2–23, 1985.
2. [2] A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal junction trees. In Uncertainty in AI (UAI’96), pages 81–89, 1996.
3. [3] C. Bessiere and J.-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. Lecture Notes in Computer Science, 1118:61–75, 1996.
4. [4] S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints, 4:199–240, 1999.
5. [5] S. Bistarelly, R. Gennari, and F. Rossi.: Constraint propagation for soft constraints: Generalization and termination conditions. In Proc. of the 6th CP, pages 83–97, Singapore, 2000.
6. [6] R. Debruyne and C. Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proc. of the 16th IJCAI, pages 412–417, Stockholm, Sweden, 1999.
7. [7] R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41–85, 1999.
8. [8] R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353–366, 1989.
9. [9] R. Dechter and I. Rish. A scheme for approximating probabilistic inference. In Proceedings of the 13th UAI-97, pages 132–141, San Francisco, 1997. Morgan Kaufmann Publishers.
10. [10] R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283–308, 20 February 1997.
11. [11] E. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29:24–32, March 1982.
12. [12] G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol1), pages 394–399, S.F., July 31–August 6 1999. Morgan Kaufmann Publishers.
13. [13] K. Kask. new search heuristics for max-csp. In Proc. of the 6th CP, pages 262–277, Singapore, 2000.
14. [14] K. Kask and R. Dechter. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129(1-2):91–131, 2001.
15. [15] K. Kask, J. Larrosa, and R. Dechter. A general scheme for multiple lower bound computation in constraint optimization. Technical report, University of California at Irvine, 2001.
16. [16] J. Larrosa and P. Meseguer. Partial lazy forward checking for max-csp. In Proc. of the 13th ECAI, pages 229–233, Brighton, United Kingdom, 1998.
17. [17] J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for max-CSP. Artificial Intelligence, 107(1):149–163, 1999.
18. [18] S. L. Lauritzen and D. J. Spiegelhalter. Local computation with probabilities on graphical structures and their applications to expert systems. Journal of the Royal Statistical Society, Series B, 34:157–224, 1988.
19. [19] A. Mackworth. Consistency in networks of constraints. Artificial Intelligence, 8, 1977.
20. [20] B. Nudel. Tree search and arc consistency in constraint satisfaction algorithms. Search in Artifical Intelligence, 999:287–342, 1988.
21. [21] T. Schiex. Arc consistency for soft constraints. In Proc. of the 6th CP, pages 411–424, Singapore, 2000.
22. [22] P.P. Shenoy. Binary join-trees for computing marginals in the shenoy-shafer architecture. International Journal of Approximate Reasoning, 2-3:239–263, 1997.
23. [23] G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search. In Proc. of the 13thAAAI, pages 181–187, Portland, OR, 1996.