Investigation of selection strategies in parallel branch and bound algorithm with simplicial partitions

Efficiency of parallel branch and bound algorithms depends on the selection strategy. The influence to the performance of parallel MPI branch and bound algorithm with simplicial partitions and aggregate Lipschitz bound using different selection strategy is evaluated experimentally. The experiments have been performed solving a number of multidimensional test problems for global optimization.