A simple solution to maximum flow at minimum cost

2nd International Conference on Information Engineering and Computer Science - Proceedings, ICIECS 2010

Volumn , Issue , 2010, Pages

  Xu, Cui Xia ^a  

^a WEIFANG UNIVERSITY   (China)

Author keywords

Adjusting path; Depth first search(DFS); Labeled digraph; Maximum flow at minimum cost

Indexed keywords

ADJUSTING PATH; DEPTH-FIRST SEARCH; LABELED DIGRAPH; MAXIMUM FLOW AT MINIMUM COST; MAXIMUM FLOWS; MINIMUM COST; SIMPLE APPROACH;

ALGORITHMS; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY;

COSTS;

EID: 79951594696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIECS.2010.5677684     Document Type: Conference Paper

References (6)

1. Bernard Kolman, Robert C.Busby, Sharon Cutler Ross. Discrete Mathematical Structures . Bejing: Higher education Press, 2006 : 297-305.
2. Zhang Xian-Chao,Jiang He,Chen Guo-Liang. Minimum cuts and maximum flows in directed planar networks with both node and edge capacities.Chinese Journal of Computers,2006,29(4): 544-551 (in Chinese).
3. Ahujia R.K.,Magnanti T.L.,Orlin J.B..Network Flows:Theory, Algorithms and Applications .New Jersey: RenticeHall,1993.
4. Zhang Xian-Chao,Chen Guo-Liang,Wan Ying-Yu.Research on the maximum network flow problem.Journal of Computer Research and Development,2003,40(9): 1281-1292(in Chinese).
5. Goldberg A.V.,Rao S..Beyond the flow decomposition barrier.Journal of ACM,1998,45(5):783-797.
6. Zhang Xian-Chao,Wan Ying-Yu,Chen Guo-Liang.Approaches to the minimumcut problem in a class of practical networks.Journal of Software,2003,14(5):885- 890(in Chinese).