参考文献

Ahuja,Ravindra K.,Thomas L.Magnanti,and James B.Orlin,Network Flows:Theory,Algorithms,and Applications.Prentice Hall,1993.

Bazarra,M.and J.Jarvis,Linear Programming and Network Flows.John Wiley＆Sons,1977.Cormen,Thomas H.,Charles E.Leiserson,Ronald L.Rivest,and Clifford Stein,Introduction to Algorithms,Second Edition.McGraw Hill,2001.

Ford,L.R.Jr.and D.R.Fulkerson,Flows in Networks.Princeton University Press,1962.

广告：个人专属 VPN，独立 IP，无限流量，多机房切换，还可以屏蔽广告和恶意软件，每月最低仅 5 美元

Fragouli,Christina and Tarik Tabet,"On conditions for constant throughput in wireless networks,"ACM Transactions on Sensor Networks(TOSN),2(3):359-379,2006,http://portal.acm.org/citation.cfm?id=1167938.

Goldberg,A.V.and R.E.Tarjan,"A new approach to the maximum flow problem,"Proceedings of the eighteenth annual ACM symposium on Theory of computing,pp.136-146,1986.http://portal.acm.org/citation.cfm?doid=12130.12144.

Leighton,Tom and Satish Rao,"Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,"Journal of the ACM,46(6):787-832,1999,http://portal.acm.org/citation.cfm?doid=331524.331526.

McCall,Edward H.,"Performance results of the simplex algorithm for a set of real-world linear programming models,"Communications of the ACM,25(3):207-212,March 1982,http://portal.acm.org/citation.cfm?id=358461.

Orden,Alex,"The Transhipment Problem,"Management Science,2(3),1956.