Computer Science ›› 2015, Vol. 42 ›› Issue (Z6): 349-350.

Previous Articles     Next Articles

Taking Lower Network Maximum Flow Algorithm

ZHAO Xiao-rong   

  • Online:2018-11-14 Published:2018-11-14

Abstract: This paper aimed at discussing the maximum flow problem on the capacity of the arc with upper and lower bounds,as well as giving an algorithm and a mathematical model associated.In other words,in the situation where the network has upper and lower limits,the maximum flow problem was transferred to minimum cost flow problem.Furthermore,an algorithm used to solve the problem was provided.

Key words: Maximum network flow,Capacity,Model,Algorithm

[1] [美]Johnsonbaugh R.离散数学[M].黄林鹏,译.北京:电子工业出版社,2009:497-508
[2] 钱颂迪,等.运筹学[M].北京:清华大学出版社,2012:312-320
[3] 胡运权.运筹学教程权[M].北京:清华大学出版社,2007:233-268
[4] 赵礼峰,白睿,等.求解网络最大流的标号算法[J].计算机技术与发展,2001,21(12):113-115
[5] 谢凡荣,贾仁安.有上下界网络最大流与最小截问题[J].运筹管理,2008,17(2):24-31
[6] 张宏斌,等.运筹学方法及应用[M].北京:清华大学出版社,2008:123-133
[7] 王志强,孙小军.网络最大流的新算法[J].计算机工程与设计,2009,30(10):2357-2359
[8] 赵礼峰,白睿.求解网络最大流问题的标号算法[J].计算机技术与发展,2011,21(12):113-115
[9] 库向阳.点和边有容量约束的网络最小费用最大流算法[J].计算机应用研究,2010,27(8):3112-311
[10] 谢政.网络算法与复杂性理论[M].长沙:国防科技大学出版社,2003:116-123
[11] 徐翠霞.深度优先搜索最大流问题的简单算法[J].潍坊学院学报,2006,6(6):30-32
[12] 陈静,单锐.容差修正网络最大流问题2F算法[J].长春工业大学学报,2008,29(6):713-716
[13] 谢利民,朱恩强,等.计算机网络最小割的问题的注记[J].数学的实践与认识,2009,39(7):170-171
[14] 高随样.图论与网络流理论[M].北京:高等教育出版社,2006:292-331

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!