[1]Xie Zheng, Li Jiangping. Network algorithms and complexity theory[M]. 2nd edition. Changsha:National University of Defense Technology Press, 2003.(in Chinese)
[2]Klein M. A primal method for minimal cost flows with applications to the assignment and transportation problems[J]. Management Science, 1967, 14(3):205220.
[3]Edmonds J, Karp R M. Theoretical improvements in algorithmic efficiency for network flow problems[J]. Journal of the ACM, 1972, 19(2):248264.
[4]Ahuja R K, Magnanti T L, Orlin J B. Network flows:Theory, algorithms, and applications[M]. London:Prentice Hall, 1993.
[5]Wang Huanxiong, Li Xijun. Optimal analysis of the path of the network with double weights[J]. Journal of Jilin Institute of Chemical Technology, 2001, 18(2):6466.(in Chinese)
[6]Zhu Detong. Dual theories of general multicommodity minimal cost flow problems[J]. OR Transactions, 2002, 6(3):1726.
[7]Sun Xiaojun, Jiao Jianmin. An algorithm for the problem of finding the minimalcost path with the minimal time[J]. Computer Engineering & Science, 2008, 30(7):7778.(in Chinese)
[8]Coello Coello C A. Evolutionary multiobjective optimization:A historical view of the field[J]. IEEE Computational Intelligence Magazine, 2006, 1(1):2836.
[9]Ao Youyun, Chi Hongqin. Differential evolution algorithm for multiobjective optimization[J]. Computer Engineering & Science, 2011, 33(9):8894.(in Chinese)
[10]Wu Runxiu. Double weighted hierarchical network algorithm based on granular computing[J]. Computer Engineering and Applications, 2011, 47(24):7787.(in Chinese)
附中文参考文献:
[1]谢政,李建平. 网络算法与复杂性理论[M].第二版. 长沙:国防科技大学出版社, 2003.
[5]王焕雄, 李喜军. 双权网络路径的最优化分析[J]. 吉林化工学院学报, 2001, 18(2):6466.
[7]孙小军, 焦建民. 一种求解最少时间最小费用路问题的算法[J]. 计算机工程与科学, 2008, 30(7):7778.
[9]敖友云, 迟洪钦. 多目标优化差分进化算法[J]. 计算机工程与科学, 2011, 33(9):8894.
[10]吴润秀. 基于粒计算的双权网络分层算法[J]. 计算机工程与应用, 2011, 47(24):7787. |