Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem

1991 ◽  
Vol 33 (5) ◽  
pp. 329-349 ◽  
Author(s):  
Jens Clausen ◽  
Jesper Larsson Träff
Keyword(s):  
Branch And Bound ◽  
Graph Partitioning ◽  
Branch And Bound Algorithms ◽  
Graph Partitioning Problem ◽  
Parallel Branch And Bound ◽  
Partitioning Problem

DO INHERENTLY SEQUENTIAL BRANCH-AND-BOUND ALGORITHMS EXIST?

1994 ◽  
Vol 04 (01n02) ◽  
pp. 3-13 ◽  
Author(s):  
JENS CLAUSEN ◽  
JESPER LARSSON TRÄFF
Keyword(s):  
Branch And Bound ◽  
Graph Partitioning ◽  
Optimization Problems ◽  
Parallel Implementation ◽  
Meaningful Work ◽  
Experimental Results ◽  
Branch And Bound Algorithm ◽  
Branch And Bound Algorithms ◽  
Graph Partitioning Problem ◽  
Partitioning Problem

In the construction of algorithms for [Formula: see text] optimization problems the Branch-and-Bound paradigm is an essential tool. Furthermore, Branch-and-Bound algorithms are traditionally regarded as well suited for parallel implementation due to the subdivision of the problem considered into essentially independent subproblems. In this paper we present experimental results for a Branch-and-Bound algorithm for the Graph Partitioning Problem showing that the traditional parallelization of a Branch-and-Bound algorithm does not always lead to an efficient parallel algorithm. The main reason seems to be lack of meaningful work, i.e. concurrent existence of subproblems which have to be solved to ensure optimality of the solution. We support this claim with experimental results.

Sign in / Sign up

Export Citation Format

Share Document