Proceedings of the 2016 International Conference on Education, Management and Computer Science

Study on Capacity Expansion Problem of Minimum Cost Flow

Authors
Geng Liu
Corresponding Author
Geng Liu
Available Online May 2016.
DOI
https://doi.org/10.2991/icemc-16.2016.62How to use a DOI?
Keywords
Directed networks; Minimum cost flow problem; Polynomial algorithm; Capacity expansion
Abstract
The minimum cost flow problem is the central object of study in the network flows. This paper studies capacity expansion problem of minimum cost flow. How to expand the network capacity effectively so that the network flow can reach a certain level with minimum total cost In view of three types of expanding models the arc-expanding model, the node-expanding model and the combination of arc-node expanding model ; this article discusses the characteristics of the problems separately and a unified capacity expansion model is also proposed. Finally, an example has been provided in detail.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Volume Title
Proceedings of the 2016 International Conference on Education, Management and Computer Science
Series
Advances in Intelligent Systems Research
Publication Date
May 2016
ISBN
978-94-6252-202-2
ISSN
1951-6851
DOI
https://doi.org/10.2991/icemc-16.2016.62How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Geng Liu
PY  - 2016/05
DA  - 2016/05
TI  - Study on Capacity Expansion Problem of Minimum Cost Flow
BT  - Proceedings of the 2016 International Conference on Education, Management and Computer Science
PB  - Atlantis Press
SP  - 300
EP  - 304
SN  - 1951-6851
UR  - https://doi.org/10.2991/icemc-16.2016.62
DO  - https://doi.org/10.2991/icemc-16.2016.62
ID  - Liu2016/05
ER  -