摘要
从图论的观点出发 ,将带选择策略的最优分配问题转化成偶图的 k-匹配问题 ,并用最大匹配、最小费用流的方法分别研究了它的 min- max和 min- sum两个基本模型 。
From the graph theoretic point of view, the optimal assignment problem with choice strategy is transformed to a bipartite k matching problem, and its two basic models of min max and min sum are respectively investigated by using the maximum matching and min cost flow. Finally, the complexity of the algorithms are analysed.
出处
《郑州大学学报（自然科学版）》
CAS
2000年第4期10-13,共4页
Journal of Zhengzhou University (Natural Science)
