Weighted heuristic anytime search: new schemes for optimization over graphical models

DOI10.1007/S10472-015-9495-1zbMath1405.68325OpenAlexW2258858780MaRDI QIDQ513336

Radu Marinescu, Rina Dechter, Natalia Flerova

Publication date: 6 March 2017

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-015-9495-1

zbMATH Keywords

combinatorial optimizationheuristic searchgraphical modelsmost probable explanationweighted CSPanytime weighted heuristic search

Mathematics Subject Classification ID

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

Uses Software

• SATzilla
• mplp2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Admissibility of \(AO^ *\) when heuristics overestimate
• Bucket elimination: A unifying framework for reasoning
• Unifying tree decompositions for reasoning in graphical models
• Heuristic search viewed as path finding in a graph
• Nonserial dynamic programming
• Anytime AND/OR depth-first search for combinatorial optimization
• Mini-buckets
• Best-First AND/OR Search for 0/1 Integer Programming
• Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS
• Branch-and-Bound Methods: A Survey
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Weighted heuristic anytime search: new schemes for optimization over graphical models