A combined parallel algorithm for solving the knapsack problem

DOI10.1134/S1064230708040072zbMath1180.90277OpenAlexW2024439802MaRDI QIDQ734010

I. Kh. Sigal, Mikhail A. Posypkin

Publication date: 19 October 2009

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230708040072

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (1)

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

Cites Work

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

This page was built for publication: A combined parallel algorithm for solving the knapsack problem