We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint optimization problems. The approach is based on AND/OR search spaces for graphical models, state-of-the-art AND/OR Branch-and-Bound search, and on decision diagrams reduction techniques. We extend earlier work on AOMDDs by considering general weighted graphs based on cost functions rather than constraints. An extensive experimental evaluation proves the efficiency of the weighted AOMDD data structure. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Mateescu, R., Marinescu, R., & Dechter, R. (2007). AND/OR multi-valued decision diagrams for constraint optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 498–513). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_36
Mendeley helps you to discover research relevant for your work.