**Algorithm::Knapsack - brute-force algorithm for the knapsack problem**

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 p...

ANDALE/Algorithm-Knapsack-0.02 - 23 Oct 2004 18:52:22 GMT - Search in distribution- filesack - pack a medium with files to the maximum

**Algorithm::Evolutionary::Fitness::Knapsack - Fitness function for the knapsack problem**

Knapsack function with penalties applied in a particular way....

JMERELO/Algorithm-Evolutionary-Fitness-v3.102 - 22 Mar 2016 19:19:48 GMT - Search in distribution- Algorithm::Evolutionary::Fitness - Base class for fitness functions
- Algorithm::Evolutionary::Fitness::ONEMAX - Fitness function for the ONEMAX or count-ones problem
- Algorithm::Evolutionary::Fitness::Rastrigin - Implementation of Rastrigin's function

**Algorithm::Evolutionary::Fitness::Knapsack - Fitness function for the knapsack problem**

Knapsack function with penalties applied in a particular way....

JMERELO/Algorithm-Evolutionary-0.80 - 31 Oct 2014 07:18:32 GMT - Search in distribution- Algorithm::Evolutionary::Fitness::Base - Base class for fitness functions
- Algorithm::Evolutionary::Fitness::ONEMAX - Fitness function for the ONEMAX or count-ones problem
- Algorithm::Evolutionary::Fitness::Rastrigin - Implementation of Rastrigin's function

**Box::Calc - Packing Algorithm**

Box::Calc helps you determine what can fit into a box for shipping or storage purposes. It will try to use the smallest box possible of the box types. If every item won't fit into your largest box, then it will span the boxes letting you know how man...

RIZEN/Box-Calc-1.0200 - 17 Sep 2015 23:01:58 GMT - Search in distribution**Data::BitMask - bitmask manipulation**

This module allows one to create bitmask manipulator objects that can be used to create bitmask values based on a list of constants, as well as to break apart masks using those constants. The advantages are that you don't have to pollute namespaces t...

TEVERETT/Data-BitMask-0.91 - 21 Mar 2004 02:15:56 GMT - Search in distribution**Algorithm::Knap01DP - Solves the 0-1 Knapsack problem using the Dynamic Programming Technique**

Solves the 0-1 Knapsack problem using the Dynamic Programming Technique. See an example of problem format $ cat knapanderson.dat 6 # number of objects 30 # capacity 14 # weight object 0 14 # profit object 0 5 # etc. 5 2 2 11 11 3 3 8 8 This correspon...

CASIANO/Algorithm-Knap01DP-0.25 - 30 May 2005 09:28:44 GMT - Search in distribution**Math::TotalBuilder - build a whole total out of valued pieces**

This module provides two subroutines, "build" and "total", which can be used to handle quantities of valued items. These can be used to build the proper tender to represent a quantity of money, to compose a mass from standard weights, to convert a di...

RJBS/Math-TotalBuilder-1.102 - 02 Oct 2013 12:48:07 GMT - Search in distribution**Algorithm::Bucketizer - Distribute sized items to buckets with limited size**

So, you own a number of mp3-Songs on your hard disc and want to copy them to a number of CDs, maxing out the space available on each of them? You want to distribute your picture collection into several folders, so each of them doesn't exceed a certai...

MSCHILLI/Algorithm-Bucketizer-0.13 5 (2 reviews) - 15 Jan 2013 03:55:57 GMT - Search in distribution