Approximate algorithms for the Knapsack problem on parallel computers

DOI10.1016/0890-5401(91)90063-8zbMATH Open0723.68042OpenAlexW2079885221MaRDI QIDQ757041FDOQ757041

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

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

zbMATH Keywords

parallel algorithmknapsack problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Approximate algorithms for the Knapsack problem on parallel computers
• Combinatorial Problems: Reductibility and Approximation

Cited In (14)

• 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
• A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
• An efficient parallel algorithm for solving the knapsack problem on hypercubes
• The two list algorithm for the knapsack problem on an FPS T20
• Computational Science - ICCS 2004
• A combined parallel algorithm for solving the knapsack problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
• An improved parallel algorithm for 0/1 knapsack problem
• Approximate algorithms for the Knapsack problem on parallel computers
• A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
• Parallel approximation schemes for subset sum and knapsack problems

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)