• DocumentCode
    3452070
  • Title

    Study on Capacity Expansion Problems on Maximum Flow

  • Author

    Geng, Liu

  • Author_Institution
    Sch. of Econ. & Manage., China Univ. of Geosci., Wuhan
  • fYear
    2008
  • fDate
    12-14 Oct. 2008
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    This article studies capacity expansion problems on maximum flow. The capacity expansion problems can be described as: how can the network capacity be increased as much as possible with a minimum total cost? In view of three types of expanding models: the node-expanding model, the arc- expanding model, the combination of the arc-expanding and node-expanding model; we discuss the characteristics of the problems separately. Considering the upper bound of the expansion capacity caused by every node or arc, we also present a unified capacity expansion formulation. Finally, an example is provided in detail.
  • Keywords
    polynomials; telecommunication networks; arc-expanding model; capacity expansion problems; maximum flow; network capacity; node-expanding model; unified capacity expansion formulation; Chaos; Communication industry; Costs; Geology; Polynomials; Roads; Transportation; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
  • Conference_Location
    Dalian
  • Print_ISBN
    978-1-4244-2107-7
  • Electronic_ISBN
    978-1-4244-2108-4
  • Type

    conf

  • DOI
    10.1109/WiCom.2008.1477
  • Filename
    4679385