摘要
本文引进了在拟阵约束条件下的可套（ｎｅｓｔｅｄ）集与可套约束分划概念，并证明了最优约束分划问题的最优解必、在可套分划处达到．从而是多项式可解的．
e generalize the nested concept to matroid constrained partitioning.With its construetion property we can determine a nested set pair(S1,S2)by Greedy algorithm. We prove that for matroid constrained partitioning problem the optimal partitioning is nested partitioning.
