Anytime AND/OR depth-first search for combinatorial optimization

DOI10.3233/AIC-2012-0531MaRDI QIDQ3164973zbMATH OpenFDO

Authors Lars Otten, Rina Dechter

Publication date 25 October 2012

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/AIC-2012-0531

zbMATH Keywords

AND/OR searchanytime performanceBayesian and constraint networkscombinatorial optimizationgraphical modelsproblem decomposition

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Weighted heuristic anytime search: new schemes for optimization over graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Subproblem ordering heuristics for AND/OR best-first search
• AND/OR search spaces for graphical models

Cited in

(9)

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Depth-first iterative-deepening: An optimal admissible tree search
• Subproblem ordering heuristics for AND/OR best-first search
• Efficient semidefinite branch-and-cut for MAP-MRF inference
• MAP inference via _2-sphere linear program reformulation
• Variable neighborhood search for graphical model energy minimization
• scientific article; zbMATH DE number 1406246 (Why is no real title available?)
• Weighted heuristic anytime search: new schemes for optimization over graphical models

Describes a project that uses

Uses Software

• DAOOPT

This page was built for publication: Anytime AND/OR depth-first search for combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3164973)