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

DOI10.1007/BF02073939zbMath0741.90080OpenAlexW2049205750MaRDI QIDQ1179744

Jesper Larsson Träff, Jens Clausen

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

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

Related Items (3)

Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Efficiency considerations in the implementation of parallel branch-and- bound

Cites Work

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

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