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

DOI10.1007/BF02073939MaRDI QIDQ1179744zbMATH OpenOpenAlexFDO

Authors Jens Clausen, Jesper Larsson Träff

Publication date 27 June 1992

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02073939

zbMATH Keywords

branch-and-bound algorithmscontinuous and discrete optimization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Simple approaches to parallel branch and bound
• scientific article; zbMATH DE number 177834
• Can Parallel Branch and Bound without Communication Be Effective?

Cites work

• A new approach to the maximum-flow problem
• A parallel branch and bound algorithm for the quadratic assignment problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• Anomalies in parallel branch-and-bound algorithms
• Minimum cuts and related problems
• Problème de la bipartition minimale d'un graphe
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem

Cited in

(12)

• Simple approaches to parallel branch and bound
• Parallel processing for difficult combinatorial optimization problems
• Efficiency considerations in the implementation of parallel branch-and- bound
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• Finding optimal solutions to the graph partitioning problem with heuristic search
• Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
• scientific article; zbMATH DE number 177834 (Why is no real title available?)
• Can Parallel Branch and Bound without Communication Be Effective?
• Using of OpenMP for optimal choice of process equipment for multiproduct batch plants
• Towards an abstract parallel branch and bound machine
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• Parallel branch and bound on fine-grained hypercube multiprocessors

This page was built for publication: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179744)