Search

Title Author Year Keyword Project  include Videos
or and

Publication

Initialization of parallel branch-and-bound algorithms
Dominik 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: http://www.ai3.uni-bayreuth.de/resypub/?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{http://www.ai3.uni-bayreuth.de/resypub/?mode=pub_show&pub_ref=henrich1993a}",
}

Download

Filename   Size   Language   Format
henrich1993a.Initialization.of.parallel.branchandbound.algorithms.djvu   116.2K   english   DJVU   download preprint
henrich1993a.Initialization.of.parallel.branchandbound.algorithms.pdf   56K   english   PDF   download preprint


© LS AI3 Uni-Bayreuth