Memory intensive AND/OR search for combinatorial optimization in graphical models
type: Item
instance of: scholarly article
title: Memory intensive AND/OR search for combinatorial optimization in graphical models
zbMATH Open document ID: 1185.68649
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: 5650763
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
MaRDI profile type: Publication
full work available at URL: j.artint.2009.07.004
OpenAlex ID: W2153806142
cites work: AND/OR branch-and-bound search for combinatorial optimization in graphical models
cites work: Recursive conditioning
cites work: Generalized best-first search strategies and the optimality of A*
cites work: A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
cites work: Mini-buckets
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Best-First AND/OR Search for 0/1 Integer Programming
cites work: Unifying tree decompositions for reasoning in graphical models
cites work: AND/OR search spaces for graphical models
cites work: Q3856120
cites work: Q4040217
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
cites work: Guided local search for solving SAT and weighted MAX-SAT problems
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: Heuristic search in restricted memory
cites work: Linear-space best-first search
DOI: 10.1016/J.ARTINT.2009.07.004
description: scientific article; zbMATH DE number 5650763