集合优化剖分问题

Set Optimal Partition Problem

本篇论文通过一个实际例子引出一个重要的组合优化问题即集合优化剖分问题。我们已知集合优化剖分问题足一个NP问题。在很多情况下集合E中的元素是有序的，故我们可以用数字集来代表那些集合，在这一个限制下，对应的集合剖分问题仍然是一个NP问题。本篇论文中我们不探讨对次优解的求法，而是对问题作一些较强限制的情况下寻求它的优化解，获得了较好的结果。

In this paper we consider the set optimal partition problem. It is recognized that this is NP program. In most cases the elements of set E is ordered, so we can displace the set by a set of numbers.If so,the problem remains a NP program. In this paper we do not investigate how to get the best approximate solution but investigate the program with some restrictions for the optimal solution, and obtain some good results.