Empirical stochastic branch-and-bound for optimization via simulation

We introduce a new method for discrete-decision-variable optimization via simulation that combines the stochastic branch-and-bound method and the nested partitions method in the sense that we take advantage of the partitioning structure of stochastic branch and bound, but estimate the bounds based on the performance of sampled solutions as the nested partitions method does. Our Empirical Stochastic Branch-and-Bound algorithm also uses improvement bounds to guide solution sampling for better performance.