| 网络流优化的快速数值逼近算法Ⅱ |
| |
| 引用本文： | 陈际平.网络流优化的快速数值逼近算法Ⅱ[J].云南大学学报(自然科学版),2006,28(5):388-391. |
| |
| 作者姓名： | 陈际平 |
| |
| 作者单位： | 陕西师范大学,数学与信息科学学院,陕西,西安,710062 |
| |
| 基金项目： | 国家自然科学基金资助项目(10571115) |
| |
| 摘 要： | 解决了网络流优化的快速数值逼近算法的稳定性问题,从而保证了用O(k(ε-2+lgk)lgn)个单个流的最小成本流的计算,来定性计算最大共存流的逼近解(其中:k是共存流数,n是节点数,而ε是精度要求)是优化的.
|
| 关 键 词： | 最大共存流 ε优化流 稳定性 逼近解 |
| 文章编号： | 0258-7971(2006)05-0388-04 |
| 修稿时间： | 2005年11月17 |
Fast approximation for network flow optimization Ⅱ |
| |
| CHEN Ji-ping.Fast approximation for network flow optimization Ⅱ[J].Journal of Yunnan University(Natural Sciences),2006,28(5):388-391. |
| |
| Authors: | CHEN Ji-ping |
| |
| Institution: | College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China |
| |
| Abstract: | It is shown a solution to the stability of the fast approximation for network flow optimization.By our method,the minimal cost flow computation can be ensured for O(k(ε-2+lgk)lgn) separate flows.Consequently,approximate solution can be obtained for the maximum-concurrent 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 concurrent commodies,n is the number of nodes,and ε is the desired precision. |
| |
| Keywords: | maximum concurrent flow ε-optimal flow stability approximate solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《云南大学学报(自然科学版)》下载免费的PDF全文 |
