Port variant | 534 |
Summary | Brute-force solution of knapsack problem (5.34) |
Package version | 0.02 |
Homepage | No known homepage |
Keywords | perl |
Maintainer | Perl Automaton |
License | Not yet specified |
Other variants | 536 |
Ravenports | Buildsheet | History |
Ravensource | Port Directory | History |
Last modified | 14 OCT 2022, 17:40:12 UTC |
Port created | 14 JUN 2017, 04:26:08 UTC |
single | The knapsack problem asks, given a set of items of various weights, find a subset or subsets of items such that their total weight is no larger than some given capacity but as large as possible. This module solves a special case of the 0-1 knapsack problem when the value of each item is equal to its weight. Capacity and weights are restricted to positive integers. |
Build and Runtime | perl-5.34:primary:standard |
main | mirror://CPAN/ID:A/AN/ANDALE |
No other ports depend on this one. |