1 paper
Hongzhen Zhang, Tim Kerkenhoff, Neil Kichler +4
Spatial Branch and Bound (B&B) algorithms are widely used for solving nonconvex problems to global optimality, yet they remain computationally expensive. Though some works have bee…