{"title":"矩形布局问题的改进贪心算法","authors":"P. Gu, Huailin Dong, Yuhui Zheng","doi":"10.1109/ICCSE.2009.5228510","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":303484,"journal":{"name":"2009 4th International Conference on Computer Science & Education","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved greedy algorithm for rectangles packing problem\",\"authors\":\"P. Gu, Huailin Dong, Yuhui Zheng\",\"doi\":\"10.1109/ICCSE.2009.5228510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":303484,\"journal\":{\"name\":\"2009 4th International Conference on Computer Science & Education\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 4th International Conference on Computer Science & Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSE.2009.5228510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 4th International Conference on Computer Science & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2009.5228510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.