Implementation of parallel optimization algorithms using generalized branch and bound template

Abstract

In this paper a template for implementation of parallel branch and bound algorithms is considered. Standard parts of branch and bound algorithms are implemented in the template and only method specific rules should be implemented by the user. The sequential version of the template allows easy testing of different variants of algorithms. Using parallel version of the template the user can obtain parallel programs without actually doing parallel programming. Several parallel global and combinatorial optimization algorithms have been implemented using template and the results are presented.