A branch-and-bound approach to solving influence 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 implementation of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solving influence diagrams with multiple stages.
And-Or search with branch and bound has been previously used to evaluate influence diagrams when no constraint propagation is involved REF .
Solving Multistage Influence Diagrams using Branch-and-Bound Search
ArXiv
ArXiv
Computer Science