๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

โœ Scribed by Michael J. Quinn; Narsingh Deo

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
586 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An asynchronous parallel branch-and-boun
An asynchronous parallel branch-and-bound algorithm
โœ 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

The critical-item, upper bounds, and a b
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
โœ Shaw, Dong X.; Cho, Geon ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB ๐Ÿ‘ 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac

A best-first branch-and-bound algorithm
A best-first branch-and-bound algorithm for orthogonal rectangular packing problems
โœ Mhand Hifi; Rachid Ouafi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 294 KB

In this paper we discuss the problem of packing a set of small rectangles (pieces) in an enclosing ยฎnal rectangle. We present ยฎrst a best-ยฎrst branch-and-bound exact algorithm and second a heuristic approach in order to solve exactly and approximately this problem. The performances of the proposed a