Initialization of parallel branch-and-bound algorithms

Titelangaben

Henrich, Dominik:
Initialization of parallel branch-and-bound algorithms.
In: Parallel Processing for Artificial Intelligence 2. - Amsterdam : North-Holland , 1994 . - S. 131-144 . - (Machine Intelligence and Pattern Recognition ; 15 )
ISBN 9780444818379
DOI: https://doi.org/10.1016/B978-0-444-81837-9.50015-4

Weitere URLs

Angaben zu Projekten

Abstract

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.