| 智能搜索算法求解最大团问题研究 |
| |
| 引用本文： | 周旭东,王丽爱,陈崚. 智能搜索算法求解最大团问题研究[J]. 计算机应用与软件, 2008, 25(5): 10-12 |
| |
| 作者姓名： | 周旭东 王丽爱 陈崚 |
| |
| 作者单位： | 1. 扬州大学信息学院,江苏,扬州,225009
2. 扬州大学信息学院,江苏,扬州,225009;南京大学软件新技术国家重点实验室,江苏,南京,210093 |
| |
| 基金项目： | 国家自然科学基金(60473012);国家科技攻关项目(2003BA614A-14);江苏省自然科学基金(BK2005047). |
| |
| 摘 要： | 最大团问题MCP（Maximum Clique Problem）在国外得到了广泛的研究，在国内刚起步，是一类NP完全问题。传统的确定性算法不能有效地进行求解。定义了MCP；介绍了使用启发式算法求解MCP的研究进展；综述了几种典型的智能搜索算法；分析了使用这些典型算法求解MCP的基本思想；研究了这些智能算法在求解MCP时的特点及性能。
|
| 关 键 词： | 最大团问题 启发式算法 智能搜索算法 |
| 修稿时间： | 2006-09-06 |
STUDY ON SOLVING MCP BY INTELLIGENT SEARCH ALGORITHM |
| |
| Zhou Xu-dong,Wang Li-ai,Chen Ling. STUDY ON SOLVING MCP BY INTELLIGENT SEARCH ALGORITHM[J]. Computer Applications and Software, 2008, 25(5): 10-12 |
| |
| Authors: | Zhou Xu-dong Wang Li-ai Chen Ling |
| |
| Affiliation: | Zhou Xudong1 Wang Liai1 Chen Ling1,21(College of Information,Yangzhou University,Yangzhou 225009,Jiangsu,China)2(National Key Lab of Novel Software Technology,Nanjing University,Nanjing 210093,China) |
| |
| Abstract: | MCP as an NP-Complete problem is widely studied abroad but in China the research just started.As the traditional determinate algorithms cannot solve MCP effectively,this paper introduces the development of using heuristic algorithm to solve MCP and expresses an overview on some typical intelligent search algorithms as well as analyzes the basic approach on its application.The traits and performances of these intelligent algorithms on solving MCP were discussed as well. |
| |
| Keywords: | Maximum clique problem(MCP) Heuristic algorithm Intelligent search algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
