Publikationsdatenbank
Publication
Initialization of parallel branch-and-bound algorithmsDominik Henrich
Abstract (english)
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.
Publication data
| Year: | 1993 |
| Publication date: | 29. August 1993 |
| Source: | Second International Workshop on Parallel Processing for Artificial Intelligence (PPAI-93), 29. August 1993, Chambery, France (to be published by Elsevier in 1994) |
| Project: | PARO , LOADBAL |
| Referrer: | https://www.ai3.uni-bayreuth.de/de/publikationen/resypub/index.php?mode=pub_show&pub_ref=henrich1993a |
BibTeX
@MISC{henrich1993a,
TITLE = "Initialization of parallel branch-and-bound algorithms",
AUTHOR = "Henrich, Dominik",
YEAR = "1993",
JOURNAL = "Second International Workshop on Parallel Processing for Artificial Intelligence (PPAI-93), 29. August 1993, Chambery, France (to be published by Elsevier in 1994)",
HOWPUBLISHED = "\url{https://www.ai3.uni-bayreuth.de/de/publikationen/resypub/index.php?mode=pub_show&pub_ref=henrich1993a}",
}
Download
| Filename | Size | Language | Format | ||||
|---|---|---|---|---|---|---|---|
| henrich1993a.Initialization.of.parallel.branchandbound.algor ithms.djvu |
116.2K | english | DJVU | download preprint | |||
| henrich1993a.Initialization.of.parallel.branchandbound.algor ithms.pdf |
56K | english | download preprint |