A central problem of branch-and-bound methods for global optimization is that lower bounds are often not exact even if the diameter of the subdivided regions shrinks to zero. This can lead to a large number of subdivisions ...