| 可套约束分划 |
| |
| 引用本文： | 姚恩瑜. 可套约束分划[J]. 浙江大学学报(工学版), 1995, 29(3): 296-302 |
| |
| 作者姓名： | 姚恩瑜 |
| |
| 摘 要： | 本文引进了在拟阵约束条件下的可套（ｎｅｓｔｅｄ）集与可套约束分划概念，并证明了最优约束分划问题的最优解必、在可套分划处达到．从而是多项式可解的．
|
| 关 键 词： | 可集套 可套分划 拟阵 最佳约束分划 |
The nested constrained partitioning |
| |
| Yao Enyu. The nested constrained partitioning[J]. Journal of Zhejiang University(Engineering Science), 1995, 29(3): 296-302 |
| |
| Authors: | Yao Enyu |
| |
| Affiliation: | Depatment of Mathematic |
| |
| Abstract: | 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. |
| |
| Keywords: | et partitioning Nested matroid constraint |
| 本文献已被 CNKI 维普 等数据库收录！ |
