Multisection in interval branch-and-bound methods for global optimization II. Numerical tests

We have investigated variants of interval branch-and-bound algorithms for g lobal optimization where the bisection step was substituted by the subdivis ion of the current, actual interval into many subintervals in a single iter ation step. The results are published in two papers, the first one contains the theoretical investigations on the convergence properties. An extensive numerical study indicates that multisection can substantially improve the efficiency of interval global optimization procedures, and multisection see ms to be indispensable in solving hard global optimization problems in a re liable way.