A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems

DOI10.1080/03155986.1994.11732247MaRDI QIDQ4313820zbMATH OpenOpenAlexFDO

Authors Thomas E. Gerasch, Pearl Y. Wang

Publication date 29 November 1994

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1994.11732247

zbMATH Keywords

parallel computinggreedy algorithmsinteger knapsack problems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Integer programming (90C10)

Recommendations

• A new algorithm for the integer knapsack problem and its parallelization
• Approximate algorithms for the Knapsack problem on parallel computers
• scientific article; zbMATH DE number 3989108
• An improved parallel algorithm for 0/1 knapsack problem
• A combined parallel algorithm for solving the knapsack problem

Cited in

(5)

• Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
• Parallel Algorithms for Knapsack Type Problems
• An improved parallel algorithm for 0/1 knapsack problem
• Solving knapsack problems on GPU
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

This page was built for publication: A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems

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