摘要
对具有两个权的有向网络的最优路径问题 ,从不同角度进行了探讨 .给出了计算两个节点间的使费用与容量之比最小的路径的多项式算法 .并证明了算法有较好的收敛性 .
The problem of the optimal path of directed network with double weights is approached from different angles, and a polynomial algorithm is presented to determine a path between two specified nodes, which minimizes the ratio of cost to capacity. The better convergence of the algorithm is also proved.
出处
《吉林化工学院学报》
CAS
2001年第2期64-66,共3页
Journal of Jilin Institute of Chemical Technology
关键词
双权有向网络
最优路径
最优化算法
directed network with double weights
optimal path
optimization algorithm
