Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of University of Electronic Science and Technology of China》 2006-01
Add to Favorite Get Latest Update

Research on Network Max-flow Pareto Expansion Problem

ZHANG Gang-ting,JIANG Xiao-bing,WANG Shu-zhen (1. Department of Computer Science, Xi’an University of Arts and Science Xi’an 710065; 2. School of Economics & Management, Xidian University Xi’an 710071)  
The network capacity is defined as the value of the maximum s-t flow, and a unified model is introduced for the network capacity expansion with the time and cost constraints. By the transformation of the underlying network, the network capacity is converted to a minimum cost flow problem instead. Also developed are the algorithm to find all pareto optimal solutions about time and cost with given expanded network max-flow. The model and algorithm are proven to be valid with an example, and they not only allow capturing various types of capacity expansion, but also are useful in network programming.
【CateGory Index】: TP393.06
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Co-citations】
Chinese Journal Full-text Database 4 Hits
1 WU Yun~(1,3),ZHOU Jian~2,YANG Yang~1(1. School of Management, Wuhan University of Technology,Wuhan 430077,China;2. Department of Computer Sciences , University of Angers,Angers France;3. School of Management , Huazhong Universtiy of Science and Technology,Wuhan 430077,China);A Chance-constrained Model and Intelligent Algorithm for Stochastic Network Bottleneck Capacity Expansion[J];Systems Engineering;2005-04
2 WU Yun ~(1,3),ZHOU Jian ~(2 ),YANG Jun ~(1) (1. College of Management, Huazhong University of Science and Technology, Wuhan 430077, China; 2. Department of Computer Sciences, University of Angers, France; 3. College of Management, Wuhan University of Technology, Wuhan 430077, China);Expected Value Model for Stochastic Network Bottleneck Capacity Expansion[J];Industrial Engineering and Management;2005-04
3 WU Yun1,LIN Yi2,ZHOU Jian31.College of Management,Wuhan University of Technology,Wuhan 430073,China;2.College of Chemistry and Molecular Sciences,Wuhan University,Wuhan 430072,China;3.Department of Computer Sciences,University of Angers,France;Chance-constrained programming model for network expansion[J];Journal of Management Sciences in China;2007-02
4 Wang Liping 1 Wang Shuzhen 2 Xu Guohua 21 (Dept.of Computer,lüliang Higher Technical College,Lishi 033000) 2 (School of Electromechanical Engineering,Xidian Univ.,Xi'an710071);The Network Capacity Expansion Problem with the Time and Cost Constraints[J];Computer Engineering and Applications;2003-11
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved