求解三角形Packing问题的贴边算法  

A Conjoint Algorithm for Solving the Triangles Packing Problem

作　　者：王瑞民[1] 刘磊[2] 

机构地区：[1]郑州大学信息工程学院,河南郑州450052 [2]河南公安高等专科学校信息安全系,河南郑州450002

出　　处：《郑州大学学报（工学版）》2005年第3期94-97,共4页Journal of Zhengzhou University（Engineering Science）

基　　金：郑州大学引进人才科研基金资助项目

摘　　要：NP难度问题的求解一直是计算机科学技术的一个瓶颈任务.自20世纪70年代以来的研究结果表明,求解NP难度问题不存在既完整严格又不太慢的求解算法.三角形Packing问题是NP难的.本文给出了角区的分类,并继续沿着拟人的途径,给出了求解三角形Packing问题的贴边策略.以贴边策略为基础发展出新的贴边拟人算法.实验结果表明,贴边拟人算法具有更高的完整性.Solving NP hard problems is always the bottleneck task for computer science and techniques. Investigations from the 1970＇s to now show that for NP hard problems, there is still not an algorithm that is both complete and rigorous and not too slow. The triangles packing problem is one of the NP hard problems. Personificaion approach draws on analogy between the resolving problem and some social phenomena. According to personification approach, some strategies for tackling the triangles packing problem are presented and two highly efficient approximate algorithms have been developed based on these strategies. The result of our tests shows that the algorithm to solve the triangles packing problem by using personification approach is of high efficiency.

关 键 词：三角形PACKING问题 贴边 价值度 拟人策略 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]