Based on the greedy algorithm, a heuristic algorithm for set covering problem is proposed according to wisdom and experience of human being in this paper.
本文以贪心算法为基础,利用人类的智慧和经验,提出了一种求解集合覆盖问题的启发式算法。
参考来源 - 一种求解集合覆盖问题的启发式算法 in C·2,447,543篇论文数据,部分数据来源于NoteExpress
Set covering (basketball) problem
集合覆盖(篮球)问题
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。
We'll also be covering a set of related areas.
我们还会涉及一些相关的领域
应用推荐