Wechsung, Achim; Schaber, Spencer; Barton, Paul - In: Journal of Global Optimization 58 (2014) 3, pp. 429-438
In continuous branch-and-bound algorithms, a very large number of boxes near global minima may be visited prior to termination. This so-called cluster problem (J Glob Optim 5(3):253–265, <CitationRef CitationID="CR4">1994</CitationRef>) is revisited and a new analysis is presented. Previous results are confirmed, which state that at...</citationref>
