期刊文献+

基于网络流矩阵求解网络最大流 被引量:8

The Network Maximum flow Based on the Flow Matrix
下载PDF
导出
摘要 通过建立网络流矩阵及相关概念,研究其性质,从理论上提出了基于网络流矩阵的最大流求解方法,并且给出了严格的数学证明和具体步骤。主要采用了节点流量平衡、转化为矩阵、矩阵降阶的思想。这些思想的应用具有重要的理论意义,同时也为研究最小费用最大流问题开辟了新途径,和其它方法比较,本文的方法具有操作简单、易于实现等优点。 With establishing the network flow matrix and related concept, studying its property, this paper get the new idea to solve the network maximum flow based on the flow matrix and give out the strict mathematics prove from the theories. The paper adopts the methods of the node flow balance, problem conversion and reducing the matrix order. The application of these methods has important theories meaning, also for study minimum expenses maxmum flow problem developed a new path. Comparing with other algorithms, the method to solve the network maximum flow based on the flow matrix has the simple computing processes and is easy to realization.
出处 《系统工程》 CSCD 北大核心 2007年第10期122-125,共4页 Systems Engineering
基金 国家自然科学基金资重大研究计划助项目(90205019)
关键词 最大流 矩阵 网络流矩阵 Maximum Flow Matrix Network Flows Matrix
  • 相关文献

参考文献6

  • 1凌永发,徐宗本.一种求解网络最大流问题的算法[J].计算机科学,2006,33(6):39-41. 被引量:8
  • 2张宪超,陈国良,万颖瑜.网络最大流问题研究进展[J].计算机研究与发展,2003,40(9):1281-1292. 被引量:52
  • 3Xue J,Knoop J. A fresh look at PRE as a maximum flow problem[A]. International Conference on Compiler Construction(CC'06). Lecture Notes in Computer Science, 2006,4114 : 139 - 154.
  • 4Du D L, Chandrasekaran R. The multiroute maximum flow problem revisited [J]. Networks: An International Journal, 2006,47(2): 81- 92
  • 5Guerriero F. Experimental evaluation of solution approaches for the K-route maximum flow problem[J]. Computers & Operations Research, 2005,32 (9):2453 -2478.
  • 6杨有龙.求网络最大流的新方法-平衡法[A].常显奇.军事运筹学应用研究与人才培养-95’军事运筹学学术年会论文集[C].北京:军事科学出版社,1995.215-218.

二级参考文献135

  • 1R K Ahuja, J B Orlin. A fast and simple algorithm for the maximum flow problem. Oper Res, 1989, 37(5) : 748~759.
  • 2R K Ahuja, J B Orlin, R E Tarjan. Improved time bounds for the maximum flow problem. SIAM J Computing, 1989, 18(5): 939-954.
  • 3N Alon. Generating pseudo-random permutations and maximum flow algorithms. Information Processing Letters, 1990, 35 ( 4 ) :201-203.
  • 4V King, S Rao, R Tarjan. A faster deterministic maximum flow algorithm. J Algorithms, 1994, 17(3): 447~474.
  • 5J Cheriyan, T Hagerup, K Mehlhom. An O( n^3)-time maximum flow algorithm. SIAMJ Computing, 1996, 25(6): 1144~1170.
  • 6H N Gabow. Scaling algorithms for network problems. J Comput System Sci, 1985, 31(2): 148-168.
  • 7R K Ahuja, J B Orlin. Distance-directed augmenting path algorithms for the maximum flow problem. Naval Research Logisties Quarterlv. 1991. 38(2): 413~430.
  • 8V M Malhotra, M P Kumar, S N Mahesh-wari. An O ( | V^3| )algorithm for finding maximum flows in networks. Information Processing Letters, 1978, 7(6) : 277~278.
  • 9A V Goldberg, R E Tarjan. Finding minimum-cost circulations by successive approximation. Math Oper Res, 1990, 15(3): 430~466.
  • 10D Hochbuam. The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. In: R E Bixby, E A Boyd, Roger et al eds. Proc of the Integer Programming and Combinatorial Optimization 6th Int' l Conf ( LNCS 1412 ) .Heidelberg: Springer-Verlag, 1998. 325~337.

共引文献56

同被引文献58

引证文献8

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部