Anytime AND/OR depth-first search for combinatorial optimization
From MaRDI portal
Publication:3164973
DOI10.3233/AIC-2012-0531zbMath1250.90075MaRDI QIDQ3164973
Publication date: 25 October 2012
Published in: AI Communications (Search for Journal in Brave)
combinatorial optimizationgraphical modelsproblem decompositionAND/OR searchanytime performanceBayesian and constraint networks
Related Items (5)
Subproblem ordering heuristics for AND/OR best-first search ⋮ Weighted heuristic anytime search: new schemes for optimization over graphical models ⋮ Variable neighborhood search for graphical model energy minimization ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ MAP inference via \(\ell_2\)-sphere linear program reformulation
Uses Software
This page was built for publication: Anytime AND/OR depth-first search for combinatorial optimization