×

zbMATH — the first resource for mathematics

Template realization of generalized branch and bound algorithm. (English) Zbl 1138.90501
Summary: We consider a template for implementation of parallel branch and bound algorithms. The main aim of this package is 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 detail. Results of computational experiments are presented and discussed.

MSC:
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27 Combinatorial optimization
65Y05 Parallel numerical computation
Software:
PICO; PROFIL/BIAS
PDF BibTeX XML Cite