| 引用本文: | 谢政,陈浩光.赋双权二部图中最大权最小权完美匹配.[J].国防科技大学学报,1994,16(4):98-101.[点击复制] |
| Xie Zheng,Chen Haoguang.A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights[J].Journal of National University of Defense Technology,1994,16(4):98-101[点击复制] |
|
| |
|
|
| 本文已被：浏览 6473次 下载 6195次 |
| 赋双权二部图中最大权最小权完美匹配 |
| 谢政, 陈浩光 |
|
(国防科技大学 系统工程与数学系 湖南 长沙 410073)
|
| 摘要: |
| 本文涉及的是在赋双权的二部图中求关于第一个权最大的限制下、第二个权最小的完美匹配的网络模型，给出了这一模型的有效算法，并用此算法解决了企业的优化组合分工中的挖潜问题。 |
| 关键词: 二部图 二分网络 匹配 完美匹配 |
| DOI： |
| 投稿日期：1993-05-25 |
| 基金项目: |
|
| A Max-min Weight Perfect Matching in Bipartite Graph with Two Edge Weights |
| Xie Zheng, Chen Haoguang |
|
(Department of System Engineering and Mathematics，NUDT，Changsha，410073)
|
| Abstract: |
| In this paper, we built a network model of max-min weight perfect matching in the bipartite graph with two edge weights,and give an efficient algorithm for it. Lastly, we solve a particular assignment problem. |
| Keywords: bipartite graph bipartite network matching perfect matching |
|
|
