期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：4
页码：78-81
出版社：International Journal of Computer Science and Network Security
摘要：Rectangle packing problem often appears in encasement and cutting as well as layout of homepage or newspaper, etc. This problem has been shown to be NP hard. For solving this problem, many compute algorithms based on different strategies are presented in the literatures. A novel-computing algorithm is proposed in this paper. The novel match algorithm tested the instances that taken from the literatures. The computational results demonstrate that the novel algorithm is rather optimal and efficient for solving rectangle block packing problem.
