Berenguel, J.; Casado, L.; García, I.; Hendrix, E.; … - In: Journal of Global Optimization 56 (2013) 3, pp. 1101-1121
Interval branch-and-bound (B&B) algorithms are powerful methods which look for guaranteed solutions of global optimisation problems. The computational effort needed to reach this aim, increases exponentially with the problem dimension in the worst case. For separable functions this effort is...