郑州大学学报(自然科学版)2000，Vol.32Issue(4)：10-13,4.
带选择策略的最优分配问题
An Optimal Assignment Problem with Choice Strategy
杨爱峰1
作者信息
- 1. 郑州大学系统科学与数学系，郑州 450052
- 折叠
摘要
Abstract
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.关键词
K-匹配/最大匹配/最小费用流Key words
k-matching/maximum matching/min-cost flow分类
数理科学引用本文复制引用
杨爱峰..带选择策略的最优分配问题[J].郑州大学学报(自然科学版),2000,32(4):10-13,4.
