Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method

DOI10.1134/s0965542507090084OpenAlexW1970385836MaRDI QIDQ6123149

Mikhail A. Posypkin, I. Kh. Sigal

Publication date: 4 March 2024

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

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

zbMATH Keywords

knapsack problemdiscrete optimizationlocal optimizationbranch-and-bound methodalgorithms for parallel computations

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Cites Work

• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method