On the supermodular knapsack problem
β Scribed by G. Gallo; B. Simeone
- Publisher
- Springer-Verlag
- Year
- 1989
- Tongue
- English
- Weight
- 631 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Chang et al. [Parallel Comput. (1994) 233] introduced a parallel algorithm based on a shared memory SIMD architecture for the generation phase of the classic Horowitz and Sahni [J. ACM 21(2) (1974) 277] two-list serial algorithm for the knapsack problem. They claimed that their parallel generation p
In this paper, we investigate a relation between the equality constrained Knapsack and Group Knapsack problems. This relation concerns the periodicity of optimal solutions of the Knapsack problem. We study the smallest integer b\* such that for every b > b\*, the Knapsack problem of size b is equiva