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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dominik Henrich
URN (permanent link):urn:nbn:de:hbz:386-kluedo-9601
Document Type:Article
Language of publication:English
Year of Completion:1993
Year of Publication:1993
Publishing Institute:Technische Universität Kaiserslautern
Tag:AG-RESY ; LOADBAL ; PARO ; combinatorial algorithms ; efficiency; idle times ; optimization ; parallel processing ; static load balancing
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:004 Datenverarbeitung; Informatik
Collections:AG RESY

$Rev: 12793 $