Anytime AND/OR depth-first search for combinatorial optimization

From MaRDI portal

Publication:3164973

Jump to:navigation, search

DOI10.3233/AIC-2012-0531zbMath1250.90075MaRDI QIDQ3164973

Lars Otten, Rina Dechter

Publication date: 25 October 2012

Published in: AI Communications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization graphical models problem decomposition AND/OR search anytime performance Bayesian and constraint networks

Mathematics Subject Classification ID

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

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

DAOOPT

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3164973&oldid=16420933"