scientific article; zbMATH DE number 2075843
From MaRDI portal
Publication:4470890
Recommendations
- A parallel two-list algorithm for the knapsack problem
- Comments on parallel algorithms for the knapsack problem.
- A new algorithm for the integer knapsack problem and its parallelization
- scientific article; zbMATH DE number 5026927
- Approximate algorithms for the Knapsack problem on parallel computers
Cited in
(14)- The two list algorithm for the knapsack problem on an FPS T20
- An improved parallel algorithm for 0/1 knapsack problem
- A parallel two-list algorithm for the knapsack problem
- Comments on parallel algorithms for the knapsack problem.
- A new algorithm for the integer knapsack problem and its parallelization
- Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
- A parallel time-memory-processor tradeoff \(O(2^{5n/6})\) for knapsack-like NP-complete problems
- A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
- scientific article; zbMATH DE number 5026927 (Why is no real title available?)
- Computational Science - ICCS 2004
- An efficient parallel algorithm for solving the knapsack problem on hypercubes
- Approximate algorithms for the Knapsack problem on parallel computers
- Observations on optimal parallelizations of two-list algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470890)
