Schöbel, Anita; Scholz, Daniel - In: European Journal of Operational Research 232 (2014) 2, pp. 266-275
Geometric branch-and-bound techniques are well-known solution algorithms for non-convex continuous global optimization problems with box constraints. Several approaches can be found in the literature differing mainly in the bounds used.