Introduction - If you have any usage issues, please Google them yourself
problem given a container, its long-L, width W and H for high, the existing batch of cylindrical wood, wood-per-L are, but different radius, based its i-ri radius of the wood. Asked how crates, containers make maximum utilization of space? The procedural requirements with greedy algorithm : greedy algorithm always make the current appears to be the best option. That is to say, not on the whole be considered optimal, it is made only in a sense, the local optimal solution.