| 网络流的多重解问题研究 |
| |
| 引用本文： | 陈捷.网络流的多重解问题研究[J].交通科技与经济,2008,10(2):108-110. |
| |
| 作者姓名： | 陈捷 |
| |
| 作者单位： | 中南大学,交通运输工程学院,湖南,长沙,410075 |
| |
| 摘 要： | 介绍了最大流问题的多解，并从此问题出发，研究了最小费用最大流的多重最优解问题，总结了判断多重最优解存在的准则。该准则为若已求出的最小费用最大流分配网络中存在其两个弧组费用相等的可调圈，此问题就有多重最优解。在符合条件的可调圈上进行流量调整，便可得到该最小费用流问题不同的最优解。
|
| 关 键 词： | 最小费用最大流 最大流问题 多重解 可调圈 |
| 文章编号： | 1008-5696(2008)02-0108-03 |
| 修稿时间： | 2007年5月24日 |
Study on Multiple Solution Problom for the Network Flow |
| |
| CHEN Jie.Study on Multiple Solution Problom for the Network Flow[J].Technology & Economy in Areas of Communications,2008,10(2):108-110. |
| |
| Authors: | CHEN Jie |
| |
| Institution: | CHEN Jie (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China) |
| |
| Abstract: | By introducing the largest number-flow problems,and starting from the problem analysis and study of the minimum costs of the largest flow multiple optimal solution,summed up the judgment of the existence of multiple optimal solution guidelines.The guidelines for the minimum cost if derive maximum flow distribution network of its existence Group 2 are equivalent cost parameter circle,the problem is multiple optimal solution.Subject to the conditions for the flow of communications loop adjustment of the minimum cost flow problems can be different optimal solutions. |
| |
| Keywords: | minimum cost largest flow largest flow multiple solution adjustable loop |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
