A Computational Study of Probabilistic Branch and Bound with Multilevel Importance Sampling.
Hao HuangPariyakorn ManeekulDanielle F. MoreyZelda B. ZabinskyGiulia PedrielliPublished in: WSC (2022)
Keyphrases
- branch and bound
- importance sampling
- branch and bound algorithm
- lower bound
- search algorithm
- branch and bound procedure
- monte carlo
- search space
- column generation
- upper bound
- beam search
- bayesian networks
- random variables
- kalman filter
- mathematical programming
- tree search
- optimal solution
- randomly generated problems