A parallel two-list algorithm for the knapsack problem
From MaRDI portal
Recommendations
Cited in
(14)- Parallel-distribute realization of recursive algorithm for two-level many-dimensional 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
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
- Observations on optimal parallelizations of two-list algorithm
- A systolic algorithm for solving knapsack problems
- The two list algorithm for the knapsack problem on an FPS T20
- scientific article; zbMATH DE number 5026927 (Why is no real title available?)
- A parallel time-memory-processor tradeoff \(O(2^{5n/6})\) for knapsack-like NP-complete problems
- scientific article; zbMATH DE number 2075843 (Why is no real title available?)
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- An improved parallel algorithm for 0/1 knapsack problem
- Comments on parallel algorithms for the knapsack problem.
- Solving knapsack problems on GPU
This page was built for publication: A parallel two-list algorithm for the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392066)
