𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel branch and bound on fine-grained hypercube multiprocessors

✍ Scribed by Frank Dehne; Afonso G Ferreira; Andrew Rau-Chaplin

Book ID
103595423
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
582 KB
Volume
15
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Hough Transform on Multiprocessors:
Fast Hough Transform on Multiprocessors: A Branch and Bound Approach
✍ N. Guil; E.L. Zapata πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 287 KB

The algorithm of the Fast Hough Transform presents a strong irregularity which makes its parallelization difficult, especially if we introduce certain improvements into the sequential algorithm, such as the elimination of straight lines. In this work we approach this algorithm as a branch and bound

A parallel branch-and-bound algorithm fo
A parallel branch-and-bound algorithm for integer linear programming and its implementation on a distributed multiprocessor
✍ Atsuko Ikegami; Katsuhiro Aoyagi; Hajime Iizuka πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 830 KB

## Abstract This paper describes a parallel branch‐and‐bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2. With a branch‐and‐bound algorithm, the amount of computation on each search tree node varies, and in general,