Template realization of generalized branch and bound algorithm
Milda Baravykaitė, Raimondas Čiegis, Julius Žilinskas · Mathematical Modelling and Analysis · 2005
Abstract In this work we consider a template for implementation of parallel branch and bound algorithms. The main aim of this package to ease implementation of covering and combinatorial optimization methods for global optimization. Standard parts of global optimization algorithms are implemented in the package and only method specific rules should be implemented by the user. The parallelization part of the tool is described in details. Results of computational experiments are presented and discussed.