| 禁忌搜索算法解决赋权覆盖问题 |
| |
| 引用本文： | 陈小红,陈晓东.禁忌搜索算法解决赋权覆盖问题[J].价值工程,2011,30(26):312-312. |
| |
| 作者姓名： | 陈小红 陈晓东 |
| |
| 作者单位： | 1. 西安铁路职业技术学院,西安,710014
2. 西安铁路局新丰镇车站,西安,710608 |
| |
| 摘 要： | 赋权覆盖问题在顶点个数很大的情况下很难用普通算法来解决,这篇试图用禁忌搜索算法来解决该问题,提出相应的各种技术指标,设计相应的算法,在计算机容许范围内求出一个图的边覆盖和最小覆盖数,具有较高的实用价值。
|
| 关 键 词： | 图 集合 边覆盖 |
Tabu Search Algorithm of Weighted Coverage Graph |
| |
| Chen Xiaohong,Chen Xiaodong.Tabu Search Algorithm of Weighted Coverage Graph[J].Value Engineering,2011,30(26):312-312. |
| |
| Authors: | Chen Xiaohong Chen Xiaodong |
| |
| Institution: | ① Chen Xiaohong;② Chen Xiaodong(①Xi＇an Railway Vocational ＆ Technical Institute,Xi＇an 710014,China;②Xi＇an Railway Bureau Station of Xifeng Town,Xi＇an 710608,China) |
| |
| Abstract: | It's difficult to solve the weighted coverage graphs who have large number of vertices.This paper tries to use a tabu search algorithm to solve it,puts forward a variety of technical indicators,and designs the corresponding algorithm,calculates within the edge coverage of a graph and the minimum coverage,which has a high practical value. |
| |
| Keywords: | graph set edge coverage |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
