首页 | 本学科首页   官方微博 | 高级检索  
     

最大团问题的竞争决策算法
引用本文:黄飞,宁爱兵,刘志民,何永梅,张惠珍. 最大团问题的竞争决策算法[J]. 上海理工大学学报, 2018, 40(6): 519-524
作者姓名:黄飞  宁爱兵  刘志民  何永梅  张惠珍
作者单位:上海理工大学 管理学院, 上海 200093,上海理工大学 管理学院, 上海 200093,上海理工大学 管理学院, 上海 200093,上海理工大学 管理学院, 上海 200093,上海理工大学 管理学院, 上海 200093
基金项目:国家自然科学基金资助项目(71401106);上海高校一流学科建设计划(S1201YLXK);高等学校博士学科点专项科研基金联合资助课题(20123120120005)
摘    要:分析了最大团问题的数学性质,根据推导出来的性质设计求解最大团问题的竞争决策算法,且算法的时间复杂度分析结果为O(n~3)。并用提出的算法求解最大团问题中的标准测试示例,测试结果表明,算法具有良好的求解效果。

关 键 词:竞争决策算法  最大团  竞争力函数  决策函数  资源交换规则
收稿时间:2017-11-22

Competitive Decision Algorithm for Maximum Clique Problems
HUANG Fei,NING Aibing,LIU Zhimin,HE Yongmei and ZHANG Huizhen. Competitive Decision Algorithm for Maximum Clique Problems[J]. Journal of University of Shanghai For Science and Technology, 2018, 40(6): 519-524
Authors:HUANG Fei  NING Aibing  LIU Zhimin  HE Yongmei  ZHANG Huizhen
Affiliation:Business School, University of Shanghai for Science and Technology, Shanghai 200093, China,Business School, University of Shanghai for Science and Technology, Shanghai 200093, China,Business School, University of Shanghai for Science and Technology, Shanghai 200093, China,Business School, University of Shanghai for Science and Technology, Shanghai 200093, China and Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
Abstract:The mathematical properties of maximum clique problems were analyzed, which can be used to put forward the design of a competitive decision algorithm. The time complexity of the algorithm was analyzed, and the result is O(n3). To assess the efficiency of the algorithm, it was applied to a set of benchmark problems in maximum clique problems. It turns that our algorithm clearly outperforms other heuristics for solving maximum clique problems, while obtaining better or comparable solutions.
Keywords:competitive decision algorithm  maximum clique problem  competitive force function  decision function  resources exchange rules
本文献已被 CNKI 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号