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.%赋权覆盖问题在顶点个数很大的情况下很难用普通算法来解决,这篇试图用禁忌搜索算法来解决该问题,提出相应的各种技术指标,设计相应的算法,在计算机容许范围内求出一个图的边覆盖和最小覆盖数,具有较高的实用价值.
展开▼
