...Network ModelingFileNew Program”，弹出对 话框： 28 问题类型（Problem Type）：网络最大流问题（Maximal Flow Problem） 优化条件（Objective Criterion）：最大（Maximization） 数据输入格式（Data Entry Format）：电子表格形式（Spreadsheet Matr...
基于1个网页-相关网页
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
而使用新方法可以得到NC算法，且可以证明节点和边都有容量的有向平面网络中的最小截、最大流问题都是属于NC的。
It is proved that the minimum cut and maximum flow problems in directed planar networks with both node and edge capacities are both in NC.
针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。
Abstract Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied.
应用推荐