网络流优化的快速数值逼近算法Ⅱ  

Fast approximation for network flow optimization Ⅱ

作　　者：陈际平[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,陕西西安710062

出　　处：《云南大学学报（自然科学版）》2006年第5期388-391,共4页Journal of Yunnan University(Natural Sciences Edition)

基　　金：国家自然科学基金资助项目(10571115)

摘　　要：解决了网络流优化的快速数值逼近算法的稳定性问题,从而保证了用O(k(ε-2+lgk)lgn)个单个流的最小成本流的计算,来定性计算最大共存流的逼近解(其中:k是共存流数,n是节点数,而ε是精度要求)是优化的.It is shown a .solution to the stability of the fast appropriation for network flow optimization. By our method, the minimal oost flow oomputation can be ensured for O（ k（ε^-2 ＋ lg k）lg n） separate flows. Consequently, approximate solution can be obtained for the rnaximum-ooncurrent flow and it can be ensured to be optimal. In our method, the related parameters can be roughly intepreted as follows： k means the number of ooncurrent commodies, n is the number of nodes, and e is the desired precision.

关 键 词：最大共存流 ε优化流 稳定性 逼近解 

分 类 号：O241.5[理学—计算数学] O221.7[理学—数学]