IMPLEMENTATION OF PARALLEL OPTIMIZATION ALGORITHMS USING GENERALIZED BRANCH AND BOUND TEMPLATE

M. Baravykaitė and J. Žilinskas
Additional contact information
M. Baravykaitė: Vilnius Gediminas Technical University, Saulėtekio al. 11, LT-10223 Vilnius, Lithuania
J. Žilinskas: Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania

Chapter 3 in Computer Aided Methods in Optimal Design and Operations, 2006, pp 21-28 from World Scientific Publishing Co. Pte. Ltd.

Abstract: AbstractIn 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.

Keywords: Optimization; Optimal Design; Global Optimization; Optimal Control (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.worldscientific.com/doi/pdf/10.1142/9789812772954_0003 (application/pdf)
https://www.worldscientific.com/doi/abs/10.1142/9789812772954_0003 (text/html)
Ebook Access is available upon purchase.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:wschap:9789812772954_0003

Ordering information: This item can be ordered from

Access Statistics for this chapter

More chapters in World Scientific Book Chapters from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().