|
甘爱英.运筹学[M].北京:清华大学出版社,2002:254-278.[2] 焦永兰.管理运筹学[M].北京:中国铁道出版社,2005:145-191.[3] AVINDRA R K,THOMAS M L,JAMES O B.Network flows:theory,algorithms,and applications[M].Princeton:Prentice-Hall,1993:46-210.[4] 凌永发,陈国良,李正明.网络最大流问题典型组合算法研究[J].云南民族大学学报,2006,15(3):211-214.LING Yongfa,CHEN Guoliang,LI Zhengming.Research on the typical algorithms for the maximum-flow problem of networks[J].Journal of Yunnan Nationalities University,2006,15(3):211-214.[5] NI Daiheng.Determining traffic flow characteristics by definition for application in ITS[J].IEEE Transactions on Intelligent Transportation Systems,2007,8(2):181-187.[6] GOLDBERG A V,RAOS.Flows in undirected unit capacity networks[J].SIAM J.Discrete Math.,1999,12(1):1-5.[7] 徐周波,古天龙,赵岭忠.网络最大流问题求解的符号ADD增广路径算法[J].计算机科学,2005,32(10):38-54.XU Zboubo,GU Tianlong,ZHAO Lingzhong.An augmenting-path-based symbolic add algorithm for maximum flow in networks[J].Computer Science,2005,32(10):38-54.[8] HACHTEL G D,SOMENZI F.A symbolic algorithm for maximum flow in 0-1 networks[J].Formal Methods in System Design,1997,10(2-3):207-219.[9] IRISBAHAR R,FROHM E A,CAONA C M.Algebraic decision diagrams and their applications[J].Formal Methods in Systems Design,1997,10(2-3):171-206.[10] 张宪超,万颖瑜,陈国良.一类实际网络中的最小截算法[J].软件学报,2003,14(5):885-890.ZHANG Xianchao,WAN Yingyu,CHEN Guoliang.Approaches to the minimum cut problem in a class of practical networks[J].Journal of Software,2003,14(5):885-890.[11] GOLDBERG A V.Recent developments in maximum flow algorithms[C]//Proceedings of the 6th Scandinavian Workshop on Algorithm Theory,Stockholm.Lecture Notes in Computer Science,1998:1-10.
|
点击查看大图
下载: