双权网络费用受限制的最大容量路径问题

Maximum constrained capacity path problem in networks with double weights

对双权网络的最优路径问题,从限制费用使得容量最大的角度进行了分析,利用二分方法给出了一个最优算法,最后从这个角度来分析了求支撑树的情况.

In the networks with double weights,the maximum constrained capacity path problem was analyzed from the perspective of constrained costs to obtain the maximum capacity,and then an optimal algorithm for the problem was constructed by the binary method.Finally,another optimal algorithm was presented for the relative optimization problem by the same idea.