Description: Suppose there are many box, each box can be saved on the total weight of 1.0. N items I1, I2, ..., IN, the weight of them are w1, w2, ..., Wn. The purpose is to put all the items, any weight of the box can not exceed his capacity as few boxes as possible.
To Search:
File list (Check if you may need any files):
MinBagProblem1.cpp
MinBagProblem1.h
MinBagProblemTest1.cpp
out1.txt
in.txt
Download