... 最大流问题(maximum flow problem) 最小费用流问题(minimum cost network flow problem) 最短路问题(shortest path problem) ...
基于64个网页-相关网页
We described the distribution network flow and get an algorithm of minimum cost flow about a special distribution network flow problem by extending the network simplex method.
对分配网络流做了介绍,通过将网络单纯形算法加以推广,得到了一类特殊分配网络流的最小费用流的一种算法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
然后由债务信度网络构造了容量费用网络,利用最小费用循环流问题给出了该模型的一个多项式算法。
应用推荐