最小费用最大流理论在传输电压中的应用  

The Application of Minimum Cost Maximum Flow Theory in Transmission Voltage

作　　者：方冬云[1] 

机构地区：[1]福州大学离散数学研究中心,福建福州350003

出　　处：《吉林师范大学学报（自然科学版）》2009年第4期73-76,共4页Journal of Jilin Normal University:Natural Science Edition

基　　金：福建省自然科学高校专项资助项目(A0540011)

摘　　要：用电力电缆来传输电压,而电力电缆线自身需要费用,同时电力电缆有一定的载流量.电压传输可以刻画为网络模型,它的最小费用问题相当于电力电缆长度最短同时电力电缆的载流量最大的问题;运用图论中的Dijkstra算法和Ford-Fulkerson算法来解决电压传输的最小费用问题.When we use power cables to transmit voltage, power cable per se costs money ; meanwhile, it has certain carrying capacity. Voltage transmission can be described as network model, minimizing cost is equal to minimizing the length and maximizing the carrying capacity of power cables at the same time; apply the Dijkstra algorithm and the Ford-Fulkerson algorithm in graph theory to solve the problem of minimizing cost in voltage transmission.

关 键 词：电压传输 DIJKSTRA算法 Ford-Fulkerson算法 最小费用最大流 

分 类 号：O157.5[理学—数学]