清单7 . glpsol对集合覆盖问题的报告。
提出了集合覆盖问题的一种随机近似算法。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
Randomized algorithms for the set cover problem and its variations and duals.
集合覆盖问题涉及的是二元决策变量；也就是说，它们的值只能是0或1、yes或no。
The set covering problem teaches binary decision variables; that is, they can only be 0 or 1, yes or no.
然后简单探讨了粗糙集理论的属性约简和集合覆盖问题，从而将二者联系起来。
Then discusses the attributes reduction based on Rough Set theory and set covering problem to combine them.
本文将消防设施选址问题抽象成集合覆盖问题，应用蚁群算法对集合覆盖问题进行了求解。
This paper applies Set Covering model to modeling the facility location problem, then USES Ant Colony Algorithm to solve the Set Covering model.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
主要运用集合覆盖模型对城市地下物流系统的物流节点选址问题进行了初步的分析探讨。
This paper mainly introduces the set covering model to analyze locations for urban ULS logistics links.
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.
应用推荐