1 # Buildsheet autogenerated by ravenadm tool -- Do not edit.
3 NAMEBASE= perl-Algorithm-Knapsack
7 SDESC[532]= Brute-force solution of knapsack problem (5.32)
8 SDESC[534]= Brute-force solution of knapsack problem (5.34)
10 CONTACT= Perl_Automaton[perl@ironwolf.systems]
13 SITES[main]= CPAN/ID:A/AN/ANDALE
14 DISTFILE[1]= Algorithm-Knapsack-0.02.tar.gz:main
19 OPTIONS_AVAILABLE= PERL_532 PERL_534
20 OPTIONS_STANDARD= none
21 VOPTS[532]= PERL_532=ON PERL_534=OFF
22 VOPTS[534]= PERL_532=OFF PERL_534=ON
24 DISTNAME= Algorithm-Knapsack-0.02
30 [PERL_532].USES_ON= perl:532,configure
32 [PERL_534].USES_ON= perl:534,configure
34 [FILE:367:descriptions/desc.single]
35 The knapsack problem asks, given a set of items of various weights, find a
36 subset or subsets of items such that their total weight is no larger than
37 some given capacity but as large as possible. This module solves a special
38 case of the 0-1 knapsack problem when the value of each item is equal to
39 its weight. Capacity and weights are restricted to positive integers.
43 0022f231eb3da1f28e18fcb1c92483a793ed8280db26cb241572ad9d4cdecb61 3587 Algorithm-Knapsack-0.02.tar.gz