Parallel Algorithms for Knapsack Type Problems

DOI10.1142/2616zbMATH Open0934.68125OpenAlexW1967543674MaRDI QIDQ4258595FDOQ4258595

Authors: V. Alexandrov, Graham M. Megson 

Publication date: 14 September 1999

Full work available at URL: https://doi.org/10.1142/2616

Recommendations

• scientific article; zbMATH DE number 150456
• A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
• A systolic algorithm for solving knapsack problems
• scientific article; zbMATH DE number 714583

zbMATH Keywords

knapsack type problems

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (15)

• Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
• Polarization: a new communication protocol in networks of bio-inspired processors
• A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
• Title not available (Why is that?)
• An efficient parallel algorithm for solving the knapsack problem on hypercubes
• A systolic algorithm for solving knapsack problems
• Title not available (Why is that?)
• Computational Science - ICCS 2004
• Title not available (Why is that?)
• Experiments with parallel algorithms for combinatorial problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Networks of splicing processors with evaluation sets as optimization problems solvers
• Approximate algorithms for the Knapsack problem on parallel computers
• Solving knapsack problems on GPU

Uses Software

• ADVIS

This page was built for publication: Parallel Algorithms for Knapsack Type Problems

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