Approximate algorithms for the Knapsack problem on parallel computers

DOI10.1016/0890-5401(91)90063-8MaRDI QIDQ757041zbMATH OpenOpenAlexFDO

Authors P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal

Publication date 1991

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(91)90063-8

zbMATH Keywords

parallel algorithmknapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Parallel approximation schemes for subset sum and knapsack problems
• scientific article; zbMATH DE number 2075843
• Parallel Algorithms for Knapsack Type Problems
• A combined parallel algorithm for solving the knapsack problem
• Comments on parallel algorithms for the knapsack problem.
• An efficient parallel algorithm for solving the knapsack problem on hypercubes
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems
• A new algorithm for the integer knapsack problem and its parallelization

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Approximate algorithms for the Knapsack problem on parallel computers
• Combinatorial Problems: Reductibility and Approximation
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Parallel Merge Sort
• Parallel approximation schemes for subset sum and knapsack problems

Cited in

(14)

• scientific article; zbMATH DE number 5026927 (Why is no real title available?)
• Computational Science - ICCS 2004
• A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
• An improved parallel algorithm for 0/1 knapsack problem
• scientific article; zbMATH DE number 2075843 (Why is no real title available?)
• Approximate algorithms for the Knapsack problem on parallel computers
• A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
• A combined parallel algorithm for solving the knapsack problem
• The two list algorithm for the knapsack problem on an FPS T20
• Parallel approximation schemes for subset sum and knapsack problems
• Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
• Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
• The fully polynomial approximation algorithm for the 0-1 knapsack problem
• An efficient parallel algorithm for solving the knapsack problem on hypercubes

This page was built for publication: Approximate algorithms for the Knapsack problem on parallel computers

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