## Initialization of parallel branch-and-bound algorithms

• Four different initialization methods for parallel Branch-and-bound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search tree. Furthermore, the fourth method offers the best efficiency of the overall algorithm when a centralized OPEN set is used. Experimental results by a PRAM simulation support these statements.

Author: Dominik Henrich urn:nbn:de:hbz:386-kluedo-9601 Article English 1993 1993 Technische Universität Kaiserslautern 2000/03/29 AG-RESY ; LOADBAL ; PARO ; combinatorial algorithms ; efficiency; idle times ; optimization ; parallel processing ; static load balancing Fachbereich Informatik 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik AG RESY Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$