Article ID: | iaor20134032 |
Volume: | 56 |
Issue: | 3 |
Start Page Number: | 821 |
End Page Number: | 844 |
Publication Date: | Jul 2013 |
Journal: | Journal of Global Optimization |
Authors: | Hendrix Eligius, Garca I, Berenguel Jos, Casado L |
Keywords: | estimation, global optimization |
In general, solving Global Optimization (GO) problems by Branch‐and‐Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes dynamically during the execution, the load balancing and the decision on additional processors is complicated. We use the term