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 materials remainder.

关键词： greedy strategy rectangles packing approzimate algorithminsert

作者: Pingping Gu Huailin Dong Yuhui Zheng

作者单位: Tan Kah Kee College Xiamen University Zhangzhou, China Software School Xiamen University Xiamen, China

会议类型: 国际会议

会议名称: 第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)

会议地点: 南京

会议语种:英文

页码: 131-134

在线出版日期: 2009-07-25（万方平台首次上网日期，不代表论文的发表时间）