Introduction - If you have any usage issues, please Google them yourself
that the procedure was used in the preparation of greedy law a small program to solve the problem is : No. 1 to n items, the volume of goods known. Its size will load all the boxes V, using fewer boxes