- search hit 1 of 1
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.
Download full text files
Additional Services
| 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 |
| Date of the Publication (Server): | 2000/03/29 |
| Tag: | AG-RESY; LOADBAL; PARO; combinatorial algorithms; efficiency; idle times; optimization; parallel processing; static load balancing |
| Faculties / Organisational entities: | Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Collections: | AG RESY |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |
