Deterministic branch-and-bound on distributed memory machines

DOI10.1142/S0129054199000289MaRDI QIDQ5249013zbMATH OpenOpenAlexFDO

Authors Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054199000289

zbMATH Keywords

load balancingOCPCdistributed-memory machinesparallel branch-and-boundinformation dispersal

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Branch and bound on the network model
• Branch and bound on the network model
• Simple approaches to parallel branch and bound
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• scientific article; zbMATH DE number 934535

Cites work

• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Efficient dispersal of information for security, load balancing, and fault tolerance
• How to share memory in a distributed system
• Parallel priority queues
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Representing shared data on distributed-memory parallel computers

Cited in

(6)

• An efficient data structure for branch-and-bound algorithm
• Deterministic parallel backtrack search
• Parallel branch and bound on fine-grained hypercube multiprocessors
• On one approach to realization of the branch-and-bound method on a distributed system
• Branch and bound on the network model
• Branch and bound on the network model

This page was built for publication: Deterministic branch-and-bound on distributed memory machines

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