The algorithm is based on row enumeration, which can find high-utility long itemsets directly by intersecting long transactions, without extending short itemsets step by step.
该算法基于行枚举，通过长事务的交集运算，直接得到长项集，不必从短项集逐步扩展得到长项集。
We also present an algorithm based on implicit enumeration and simplex method on network.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
应用推荐