Abstract
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP’s) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch and bound techniques. In this paper we present a new search algorithm that can obtain many of the computational benefits of decomposition without having to resort to separate recursions. That is, the algorithm explores a standard OR tree not an AND-OR tree. In this way incremental information gathered from any component can be immediately applied to improve the bounding information for all of the other components. We also discuss how caching and local propagation can be combined with our approach and finally test our methods empirically to verify their potential.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and Complexity Results for #SAT and Bayesian Inference. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 340–351 (2003)
Bensana, E., Lemaitre, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293–299 (1999)
Bouveret, S., de Givry, S., Heras, F., Larrosa, J., Rollon, E., Sanchez, M., Schiex, T., Verfaillie, G., Zytnicki, M.M.: Max-csp competition 2007. In: Proceedings of the Second International CSP Solver Competition, pp. 19–21 (2008)
Brglez, F., Bryan, D., Kozminski, K.: Combinatorial Profiles of Sequential Benchmark Circuits. In: Proceedings of the International Symposium on Circuits and Systems (ISCAS), pp. 1229–1234. IEEE, Los Alamitos (1989)
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.: Radio link frequency assignment. Constraints 4(1), 79–89 (1999)
Cooper, M., de Givry, S., Schiex, T.: Optimal soft arc consistency. In: Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pp. 68–73 (2007)
Darwiche, A.: Recursive conditioning. Artif. Intell. 126(1-2), 5–41 (2001)
de Givry, S., Schiex, T., Verfaillie, G.: Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In: AAAI, pp. 22–27 (2006)
Jégou, P., Ndiaye, S., Terrioux, C.: Dynamic heuristics for backtrack search on tree-decomposition of csps. In: IJCAI, pp. 112–117 (2007)
Kitching, M., Bacchus, F.: Symmetric component caching. In: IJCAI, pp. 118–124 (2007)
Kjaerulff, U.: Triangulation of graphs - algorithms giving small total state space, Technical Report R90-09. Technical report, Department of Computer Science, University of Aalborg (March 1990)
Larrosa, J., Meseguer, P., Sánchez, M.: Pseudo-tree search with soft constraints. In: ECAI, pp. 131–135 (2002)
Larrosa, J., Schiex, T.: Solving weighted csp by maintaining arc consistency. Artificial Intelligence 159(1-2), 1–26 (2004)
Marinescu, R., Dechter, R.: And/or branch-and-bound for graphical models. In: IJCAI, pp. 224–229 (2005)
Marinescu, R., Dechter, R.: Dynamic orderings for and/or branch-and-bound search in graphical models. In: ECAI, pp. 138–142 (2006)
Marinescu, R., Dechter, R.: Best-first and/or search for graphical models. In: Proceedings of the AAAI National Conference (AAAI), pp. 1171–1176 (2007)
Sang, T., Beame, P., Kautz, H.: Performing bayesian inference by weighted model counting. In: AAAI, pp. 475–482 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitching, M., Bacchus, F. (2008). Exploiting Decomposition in Constraint Optimization Problems. In: Stuckey, P.J. (eds) Principles and Practice of Constraint Programming. CP 2008. Lecture Notes in Computer Science, vol 5202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85958-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-85958-1_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85957-4
Online ISBN: 978-3-540-85958-1
eBook Packages: Computer ScienceComputer Science (R0)