Data-driven Spatial Branch-and-bound Algorithm for Box-constrained Simulation-based Optimization

Archive 2020

In this paper, we present a novel approach that uses convex underestimators of data and a branch-and-bound procedure to obtain globally optimal solutions of simulation-based problems.

Link to Publication

Citation: