Memory intensive AND/OR search for combinatorial optimization in graphical models
From MaRDI portal
Publication:1045991
DOI10.1016/j.artint.2009.07.004zbMath1185.68649OpenAlexW2153806142MaRDI QIDQ1045991
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.004
Bayesian networksdecompositionsearchconstraint networksgraphical modelsconstraint optimizationAND/OR search
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ 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 ⋮ Variable neighborhood search for graphical model energy minimization ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-space best-first search
- AND/OR search spaces for graphical models
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Heuristic search in restricted memory
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Earth observation satellite management
- Guided local search for solving SAT and weighted MAX-SAT problems
- Resolution versus search: Two strategies for SAT
- Bucket elimination: A unifying framework for reasoning
- Unifying tree decompositions for reasoning in graphical models
- Compiling relational Bayesian networks for exact inference
- Mini-buckets
- Best-First AND/OR Search for 0/1 Integer Programming
- Generalized best-first search strategies and the optimality of A*
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Recursive conditioning
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
This page was built for publication: Memory intensive AND/OR search for combinatorial optimization in graphical models
