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 optimization; graphical models; problem decomposition; AND/OR search; anytime performance; Bayesian and constraint networks
Related Items
Weighted heuristic anytime search: new schemes for optimization over graphical models, Subproblem ordering heuristics for AND/OR best-first search, Efficient semidefinite branch-and-cut for MAP-MRF inference, Variable neighborhood search for graphical model energy minimization
Uses Software