敞口直角容器矩形packing问题的拟人近似算法  

Anthropopathic Approximate Arithmetic of Rectangle Packing Problem in Open Orthogonal Receptacle

作　　者：赵庆林[1] 曹炬[1] 

机构地区：[1]华中理工大学数学系,武汉430074

出　　处：《计算机工程与应用》2001年第3期76-78,共3页Computer Engineering and Applications

摘　　要：众所周知，矩形Ｐａｃｋｉｎｇ问题一般指将众多矩形置入一封闭矩形容器，具有ＮＰ难度。现将封闭容器一端打开变为敞口容器，该文描述了作者在这方面所作的工作。此法改进后，对处理任意多边形极有借鉴意义。As is all known,rectangle packing problem indicates generally that making pieces of rectangle pack to the close rectangle receptacle which has NP hard. Now we will open one port of receptacle to change it into open_end case. the research on the aspect is describled in this paper. The method may deal with any polygon after reconstructing it.

关 键 词：NP问题 PACKING问题 拟近似算法 敞口容器 

分 类 号：O22[理学—运筹学与控制论]