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。
Point covering problem is hard to solve with great actual value.
点覆盖问题是一个重要的有实际意义的难解问题。
This paper discusses the point covering problem solved by ant-algorithm.
文章讨论了点覆盖问题的蚂蚁算法求解。
In this paper, a nonconvex covering problem in one dimension is dis-cussed.
本文讨论了一维空间中的非凸复盖问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The DNA molecules of the solution space are fixed on the solid carrier, and then get the all solutions of minimal vertex covering problem by the biochemical actions.
该模型首先将问题解空间的DNA分子固定在固体载体上，然后通过进行相应的生化反应来求得图的最小顶点覆盖问题的所有解。
The DNA molecules of the solution space are fixed on the solid carrier, and then get the all solutions of minimal vertex covering problem by the biochemical actions.
该模型首先将问题解空间的DNA分子固定在固体载体上，然后通过进行相应的生化反应来求得图的最小顶点覆盖问题的所有解。
应用推荐