Fast Interval Branch-and-Bound Methods for Unconstrained Global Optimization with Affine Arithmetic

We show that faster solutions to unconstrained global optimization problems can be obtained by combining previous accelerations techniques for interval branch-and-bound methods with affine arithmetic, a recent alternative to interval arithmetic that often provides tighter estimates. We support this claim by solving a few well-known optimization problems.

1997