AND/OR branch-and-bound search for combinatorial optimization in graphical models

DOI10.1016/j.artint.2009.07.003zbMath1185.68648OpenAlexW2122003883MaRDI QIDQ1045990

Rina Dechter, Radu Marinescu

Publication date: 21 December 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2009.07.003

zbMATH Keywords

Bayesian networksdecompositionsearchconstraint networksgraphical modelsconstraint optimizationAND/OR search

Mathematics Subject Classification ID

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

Related Items (11)

Learning optimal decision trees using constraint programming ⋮ Concurrent forward bounding for distributed constraint optimization problems ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Multi-dimensional classification with Bayesian networks ⋮ Subproblem ordering heuristics for AND/OR best-first search ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ Structure learning of Bayesian networks using global optimization with applications in data classification

Uses Software

• Chaff
• DAOOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc consistency for soft constraints
• Solving weighted CSP by maintaining arc consistency
• AND/OR search spaces for graphical models
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Earth observation satellite management
• Resolution versus search: Two strategies for SAT
• Bucket elimination: A unifying framework for reasoning
• Adopt: asynchronous distributed constraint optimization with quality guarantees
• Compiling relational Bayesian networks for exact inference
• Mini-buckets
• Depth-First Mini-Bucket Elimination
• New methods to color the vertices of a graph
• Branch-and-Bound Methods: A Survey
• Recursive conditioning
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)

This page was built for publication: AND/OR branch-and-bound search for combinatorial optimization in graphical models