Parallel branch and bound on fine-grained hypercube multiprocessors

DOI10.1016/0167-8191(90)90043-9MaRDI QIDQ916373zbMATH OpenOpenAlexFDO

Authors Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90043-9

zbMATH Keywords

branch and boundload balancingparallel algorithmshypercube multiprocessorsfine grained systemprocess allocation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Distributed algorithms (68W15)

Recommendations

• Simple approaches to parallel branch and bound
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
• Deterministic branch-and-bound on distributed memory machines
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• A study of parallel branch-and-bound algorithms with best-bound-first search

Cited in

(4)

• Parallel algorithms for a multi-level network optimization problem
• Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• Parallel processing for difficult combinatorial optimization problems

This page was built for publication: Parallel branch and bound on fine-grained hypercube multiprocessors

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