KnapSack

by No License

KnapSack

KNAPSACK_01 is a dataset directory which contains some examples of data for 01 Knapsack problems.In the 01 Knapsack problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. We desire to maximize our total profit, which is the sum of the profits of each object we put into the knapsack.http://people.sc.fsu.edu/~jburkardt/datasets/knapsack_multiple/knapsack_multiple.htmlhttp://rosettacode.org/wiki/Knapsack_problem/0-1large, medium datasethttp://code.google.com/p/kpacking/source/browse/#svn%2Ftrunk%2Fdatasetshttp://www.math.mtu.edu/~kreher/cages/Data.htmlgeneratorshttp://www.diku.dk/~pisinger/codes.html

Dataset Attributes

Label SVG
CategoriesMachine, Learning