Depth-First Mini-Bucket Elimination

DOI10.1007/11564751_42MaRDI QIDQ3524205zbMATH OpenOpenAlexFDO

Authors Emma Rollon, Javier Larrosa

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11564751_42

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Mini-bucket Elimination with Bucket Propagation
• Mini-buckets: a general scheme for bounded inference
• Bucket elimination for multiobjective optimization problems
• Bucket elimination: A unifying framework for reasoning
• Bucket elimination: a unifying framework for processing hard and soft constraints

Cited in

(6)

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Symbolic bucket elimination for piecewise continuous constrained optimization
• Depth-First Search Using O(n) Bits
• Mini-buckets: a general scheme for bounded inference
• Mini-bucket Elimination with Bucket Propagation

This page was built for publication: Depth-First Mini-Bucket Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524205)