Solving Multistage Influence Diagrams using Branch-and-Bound Search
Changhe Yuan, Xiaojian Wu, Eric Hansen
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.
PDF Link: /papers/10/p691-yuan.pdf
AUTHOR = "Changhe Yuan
and Xiaojian Wu and Eric Hansen",
TITLE = "Solving Multistage Influence Diagrams using Branch-and-Bound Search",
BOOKTITLE = "Proceedings of the Twenty-Sixth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-10)",
PUBLISHER = "AUAI Press",
ADDRESS = "Corvallis, Oregon",
YEAR = "2010",
PAGES = "691--700"