On the convergence rate of a branch-and-bound algorithm for unconstrained problems

Abstract: "Branch-and-bound methods have been used with mixed results for global optimization problems. The asymptotic convergence rate of a theoretical branch-and-bound algorithm for twice-differential unconstrained optimization is examined to shed light on when branch-and-bound methods can be expected to be successful. The Generalized Weber Problem from location theory is considered as a special case, with two different lower-bounding functions examined."