Spatial branch-and-bound is a divide-and-conquer technique used to find the deterministic solution of global optimization
problems.1 It is a type of branch-and-bound method, which solves for the set of parameters that globally optimize the
objective function, whether that be finding the minimum or maximum value of or , respectively, where...