A parallel best bound first branch and bound scheme

• M. Ortega ^[1] ; J.Troya ^[1]
  1. [1] Universidad Complutense de Madrid

     Universidad Complutense de Madrid

     Madrid, España

     
• Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.) , 1988, págs. 509-512
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Best-bound-first parallel branch-and-bound algorithm using as many list of live nodes as processors is discussed. In this algorithm the distribution of the live nodes among the list of live nodes becomes an important task to achieve a good performance. We present a distribution function and we evaluate and compare this algorithm with the single list branch-and bound algorithm. We stablish a measure to evaluate the efficient work done by the processors.