An Improved Greedy Algorithm for Rectangles Packing Problem

摘要

Considered the existing situation, in this paper an improved algorithm based on greedy strategies for the rectangles packing problem is proposed. The results have shown that the improved algorithm is more simply implemented and especially effective for improving probability of the recycle of large sheets of material's remainder.