Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

DOI10.1134/s0965542506120165OpenAlexW2003727283MaRDI QIDQ6200659

I. Kh. Sigal, Mikhail A. Posypkin

Publication date: 1 March 2024

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/zvmmf374

zbMATH Keywords

discrete optimizationbranch-and-bound methodalgorithms for parallel computationsmodel of computation processspeedup estimate

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• Anomalies in parallel branch-and-bound algorithms
• A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

This page was built for publication: Speedup estimates for some variants of the parallel implementations of the branch-and-bound method