建立了集合划分问题的优化数学模型，结合遗传算法的思想提出的粒子群算法来解决集合划分问题。

This paper shows us a study of the division and combination problem of DE on the basis of division and combination history along with a division and combination perspective.

youdao

集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。

The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.

youdao

本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。

This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.

youdao