AND/OR branch-and-bound search for combinatorial optimization in graphical models
type: Item
instance of: scholarly article
title: AND/OR branch-and-bound search for combinatorial optimization in graphical models
zbMATH Open document ID: 1185.68648
author: Radu Marinescu
author: Rina Dechter
published in: Artificial Intelligence
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5650762
zbMATH Keywords: search
zbMATH Keywords: AND/OR search
zbMATH Keywords: decomposition
zbMATH Keywords: graphical models
zbMATH Keywords: Bayesian networks
zbMATH Keywords: constraint networks
zbMATH Keywords: constraint optimization
describes a project that uses: Chaff
describes a project that uses: DAOOPT
MaRDI profile type: Publication
full work available at URL: j.artint.2009.07.003
OpenAlex ID: W2122003883
cites work: AND/OR search spaces for graphical models
cites work: Mini-buckets
cites work: A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
cites work: Q3856120
cites work: Solving weighted CSP by maintaining arc consistency
cites work: Q3201783
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Q3979383
cites work: Branch-and-Bound Methods: A Survey
cites work: Q4475643
cites work: Q4040217
cites work: Arc consistency for soft constraints
cites work: New methods to color the vertices of a graph
cites work: Recursive conditioning
cites work: Q4694712
cites work: Resolution versus search: Two strategies for SAT
cites work: Q4473043
cites work: Earth observation satellite management
cites work: Compiling relational Bayesian networks for exact inference
cites work: Q4012213
cites work: Adopt: asynchronous distributed constraint optimization with quality guarantees
cites work: Depth-First Mini-Bucket Elimination
DOI: 10.1016/J.ARTINT.2009.07.003
description: scientific article; zbMATH DE number 5650762