Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method

DOI10.1515/DMA-2020-0028zbMath1456.90135OpenAlexW3097297855MaRDI QIDQ828198

Mikhail A. Posypkin, Roman M. Kolpakov

Publication date: 8 January 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2020-0028

zbMATH Keywords

branch-and-bound methodsubset sum problemparallel computational complexity

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the best choice of a branching variable in the subset sum problem
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
• Tight Bounds for On-Line Tree Embeddings
• Deterministic parallel backtrack search

This page was built for publication: Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method