Efficiency considerations in the implementation of parallel branch-and-bound

The authors discuss the abstraction of the branch-and-bound paradigm and the implementation on a transputer network of kernel software supporting this paradigm. They propose a new measure, which the authors call the pseudo efficiency of an implementation, and use this measure to decide which kernel is appropriate under certain conditions. They then discuss some efficiency anomalies and show that these can occur for genuine problems.