Introduction - If you have any usage issues, please Google them yourself
Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber are of a long L, but the radius is different from the first i set the root radius of timber ri. Asked how the packing, making maximum utilization of container space? This procedure requires greedy algorithm solution: greedy algorithm is always made in the current appears to be the best option. In other words, do not be optimal from an overall consideration, it made sense only in a local optimal solution.