Description: Minimum knapsack problem: Suppose there are many boxes, each box can hold a total weight of 1.0. There are N items i1, i2, ..., iN, their weight are w1, w2, ..., wN. Purpose is to use as little as possible of all the items into the box, any box weight can not exceed his capacity. For example, if you want the weight of 0.4, 0.4, 0.6 and 0.6, with the two boxes can be solved. Strategy to solve this problem as follows: given the order by scanning each item, put each item into him and will not be able to accommodate the overflow of the most full of boxes. With a priority queue to select into the box.
To Search:
File list (Check if you may need any files):
BOX.cpp
Download