摘要
首先通过最短路算法简化了供需距离网络 ,去掉了铁路、公路等边的性质 ,使供需距离网络简化为一个供需运输价格表 .在此基础上构造了三个模型 :线性费用的网络流模型、改进的线性费用的网络流模型和具有非线性费用的网络流模型 .通过改进传统的最小费用最大流算法 ,解决了本题的非线性费用网络流模型 。
First we simplified the supply- demand distance network by using the shortest- path algorithm. We got rid of the properties of the railways and roads,reduced the supply- demanddistance network to a supply- demand transportation price table.Based on this,we constructed three models:the linear- cost- network- flow model,the developed linear- cost- network- flow model and the non- linear- cost- network- flow model.By generlizing the traditional minimum- cost- maximum- flow algorithm,we solved the non- linear- cost- network- flow model.We also gave the truth proving and the complexity- analysis to our algorithm.
出处
《数学的实践与认识》
CSCD
北大核心
2001年第1期67-74,共8页
Mathematics in Practice and Theory
