Listing 7. glpsol report for the set covering problem.
清单7 . glpsol对集合覆盖问题的报告。
The set covering problem teaches binary decision variables; that is, they can only be 0 or 1, yes or no.
集合覆盖问题涉及的是二元决策变量；也就是说，它们的值只能是0或1、yes或no。
Then discusses the attributes reduction based on Rough Set theory and set covering problem to combine them.
然后简单探讨了粗糙集理论的属性约简和集合覆盖问题，从而将二者联系起来。
Set covering (basketball) problem
集合覆盖（篮球）问题
This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
This paper applies Set Covering model to modeling the facility location problem, then USES Ant Colony Algorithm to solve the Set Covering model.
本文将消防设施选址问题抽象成集合覆盖问题，应用蚁群算法对集合覆盖问题进行了求解。
Then, the fuzzy set-covering model is transformed to a 0-1 integer planning problem through fuzzy set operation and operator transformation.
通过模糊集合运算与算子变换把模糊数学模型最终转化为一个0-1整数规划问题。
Then, the fuzzy set-covering model is transformed to a 0-1 integer planning problem through fuzzy set operation and operator transformation.
通过模糊集合运算与算子变换把模糊数学模型最终转化为一个0-1整数规划问题。
应用推荐