Solving Multistage Influence Diagrams Using Branch-and-Bound Search
Abstract
A branch-and-bound approach to solving influ- ence diagrams has been previously proposed in the literature, but appears to have never been implemented and evaluated - apparently due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, we describe how to efficiently compute effective bounds, and we develop a practical implementa- tion of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solving influence diagrams with multiple stages.
Cite
Text
Yuan et al. "Solving Multistage Influence Diagrams Using Branch-and-Bound Search." Conference on Uncertainty in Artificial Intelligence, 2010.Markdown
[Yuan et al. "Solving Multistage Influence Diagrams Using Branch-and-Bound Search." Conference on Uncertainty in Artificial Intelligence, 2010.](https://mlanthology.org/uai/2010/yuan2010uai-solving/)BibTeX
@inproceedings{yuan2010uai-solving,
title = {{Solving Multistage Influence Diagrams Using Branch-and-Bound Search}},
author = {Yuan, Changhe and Wu, XiaoJian and Hansen, Eric A.},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2010},
pages = {691-700},
url = {https://mlanthology.org/uai/2010/yuan2010uai-solving/}
}