Volume 35 Issue 1
Dec.  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2006  >  35(1): 89-92

ZHANG Gang-ting, JIANG Xiao-bing, WANG Shu-zhen. Research on Network Max-flow Pareto Expansion Problem[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(1): 89-92.
Citation: ZHANG Gang-ting, JIANG Xiao-bing, WANG Shu-zhen. Research on Network Max-flow Pareto Expansion Problem[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(1): 89-92.
shu

Research on Network Max-flow Pareto Expansion Problem

  • 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

  • Received Date: 2003-06-04
  • Publish Date: 2006-02-15
  • 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.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3546) PDF downloads(77) Cited by()

Related
Proportional views

Research on Network Max-flow Pareto Expansion Problem

  • 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
  • Received Date: 2003-06-04
  • Publish Date: 2006-02-15

Abstract: 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.

ZHANG Gang-ting, JIANG Xiao-bing, WANG Shu-zhen. Research on Network Max-flow Pareto Expansion Problem[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(1): 89-92.
Citation: ZHANG Gang-ting, JIANG Xiao-bing, WANG Shu-zhen. Research on Network Max-flow Pareto Expansion Problem[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(1): 89-92.
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return