Pages that link to "Item:Q757041"
From MaRDI portal
The following pages link to Approximate algorithms for the Knapsack problem on parallel computers (Q757041):
Displaying 14 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- The fully polynomial approximation algorithm for the 0-1 knapsack problem (Q699820) (← links)
- An efficient parallel algorithm for solving the knapsack problem on hypercubes (Q705566) (← links)
- A combined parallel algorithm for solving the knapsack problem (Q734010) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- The two list algorithm for the knapsack problem on an FPS T20 (Q1118989) (← links)
- An improved parallel algorithm for 0/1 knapsack problem (Q1195150) (← links)
- A parallel two-list algorithm for the knapsack problem (Q1392066) (← links)
- A new algorithm for the integer knapsack problem and its parallelization (Q1919114) (← links)
- Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem (Q2485128) (← links)
- A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem (Q5375394) (← links)
- (Q5469596) (← links)
- Computational Science - ICCS 2004 (Q5712865) (← links)