Efficiency considerations in the implementation of parallel branch-and- bound
type: Item
instance of: scholarly article
title: Efficiency considerations in the implementation of parallel branch-and- bound
zbMATH Open document ID: 0784.90108
DOI: 10.1007/BF02024489
author: V. J. Rayward-Smith
author: S. A. Rush
author: G. P. McKeown
published in: Annals of Operations Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474760
zbMATH Keywords: branch-and-bound paradigm
zbMATH Keywords: transputer network
MaRDI profile type: Publication
cites work: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
cites work: Superlinear speedup of an efficient sequential algorithm is not possible
cites work: Anomalies in parallel branch-and-bound algorithms
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Branch-and-bound as a higher-order function
cites work: An algorithm for the steiner problem in graphs
cites work: MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
description: scientific article; zbMATH DE number 474760