𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel branch-and-bound search in Parlog

✍ Scribed by Matthew Huntbach


Publisher
Springer
Year
1991
Tongue
English
Weight
911 KB
Volume
20
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Parallel branch-and-bound algorithms
✍ J.M. Jansen; F.W. Sijstermans πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 827 KB
An asynchronous parallel branch-and-boun
✍ Tsuyoshi Kawaguchi; Hiroshi Masuyama; Tamotsu Maeda πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 975 KB

## Abstract This paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being