Abstract
There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size.
In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. The parameter k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming.
Similar content being viewed by others
References
Arnborg, S. A. (1985). Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey. BIT, 25: 2-23.
Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press.
Bessiére, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1): 179-190.
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.
Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2): 201-236.
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., & Warners, J. P. (1999). Radio link frequency assignment. Constraints, 4: 79-89.
Dechter, R. (1990). Enhancement schemes for constraint processing: backjumping, learning, and cutest decomposition. Artificial Intelligence, 41: 273-312.
Dechter, R. (1999). Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113: 41-85.
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.
Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38: 353-366.
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.
Dechter, R., & van Beek, P. (1997). Local and global relational consistency. Theoretical Computer Science, 173(1): 283-308.
Freuder, E. C., & Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58: 21-70.
Frost D., & Dechter, R. (1994). In search of the best constraint satisfaction search. In Proceedings of the 12th AAAI, pages 301-306.
Haralick, R. M., & Elliott, G. L. (1980). Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263-313.
Kask, K., & Dechter, R. (2001). A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129: 91-131.
Larrosa, J. (2000). Boosting search with variable elimination. In Proc. of the 6th CP, LNCS, pages 291-305. Singapore: Springer Verlag.
Larrosa, J. (2002). Node and arc consistency in weighted CSP. In Proceedings of the 18th AAAI.
Larrosa, J., Meseguer, P., & Schiex, T. (1999). Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107(1): 149-163.
Lawler, E. L., & Wood, D. E. (1966). Branch-and-bound methods: a survey. Operations Research, 14(4): 699-719.
Meseguer, P., Larrosa, J., & Sanchez, M. (2001). Lower bounds for non-binary constraint optimization problems. Proceedings of the 7th CP, pages 317-331.
Nudel, B. (1988). Tree search and arc consistency in constraint satisfaction algorithms. Search in Artificial Intelligence, 999: 287-342.
Rish, I., & Dechter, R. (2000). Resolution vs. SAT: two approaches to SAT. Journal of Automated Reasoning, 24(1): 225-275.
Schiex, T. (2000). Arc consistency for soft constraints. In Proceedings of the 6th CP, Singapore, pages 411-424.
Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: hard and easy problems. In IJCAI-95, pages 631-637. Montréal, Canada.
Smith, B. (1994). Phase transition and the mushy region in constraint satisfaction. In Proceedings of the 11th ECAI, pages 100-104.
Verfaillie, G., Lemaître, M., & Schiex, T. (1996). Russian doll search. In AAAI-96, pages 181-187, Portland, OR.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Larrosa, J., Dechter, R. Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints 8, 303–326 (2003). https://doi.org/10.1023/A:1025627211942
Issue Date:
DOI: https://doi.org/10.1023/A:1025627211942