现代电子技术2018，Vol.41Issue(1)：97-100,4.DOI:10.16652/j.issn.1004-373x.2018.01.022
不可分流网络的最小费用流问题
Minimum cost flow problem in indecomposable flow network
曹卫锋 1梅霞 2张兴永2
作者信息
- 1. 扬州大学,江苏 扬州225000
- 2. 江苏农林职业技术学院 基础部,江苏 镇江212400
- 折叠
摘要
Abstract
The total flow cost is minimum when each flow is sent through the path with minimum unit flow cost. But the path with minimum unit flow cost doesn′t necessarily meet that all flows can be passed. Aiming at the minimum cost flow prob-lem of the indecomposable flow network,an algorithm for optimal solution seeking by means of flow value ranking is proposed, and its relative theoretical proof and algorithm are given. The validity of the algorithm was tested with the specific experiment. THe algorithm can solve the proposed problem quickly,and get the optimal value. The results of the practical example show that the algorithm can solve the minimum cost flow problem of the indecomposable flow network effectively,and is applied to the ac-tual network optimization.关键词
节点/最小费用流/不可分流/弧上限/最小费用路径/流值排序Key words
node/minimum cost flow/indecomposable flow/upper limit of arc/minimum cost path/flow value ranking分类
信息技术与安全科学引用本文复制引用
曹卫锋,梅霞,张兴永..不可分流网络的最小费用流问题[J].现代电子技术,2018,41(1):97-100,4.
