[1]FORD L R, FULKERSON D R. Constructing maximal dynamic flows from static flows [J]. Operations Research, 1958, 6(3): 419-433.[2]GALE D. Transient flows in networks [J]. Michigan Mathematical Journal, 1959, 6(1): 59-63.[3]MINIEKA E. Maximal, lexicographic, and dynamic network flows [J]. Operations Research, 1973, 21(2): 517-527.[4]FLEISCHER L K, TARDOS E. Efficient continuous-time dynamic network flow algorithms [J]. Operations Research Letters, 1998, 23(3/4/5): 71-80.[5]SKUTELLA M. Quickest flows over time [J]. SIAM Journal on Computing, 2007, 36(6): 1600-1630.[6]SKUTELLA M. An introduction to network flows over time [C]// Research Trends in Combinatorial Optimization. Berlin: Springer, 2009: 451-482.[7]庞博,谢政,陈挚.动态容量网络中的最小最大时间流问题[J].计算机工程,2010,36(7):252-254.[8]李荣胜,赵文峰,徐惠民.网格作业完工时间与作业分割粒度的关系[J].计算机应用,2011,31(2):530-547.[9]高飞,王光兴,阎家斌.计算无线通信网络2-终点可靠性的快速算法[J].计算机应用,2004,24(1):25-28.[10]孙奥,朱桂斌,江铁,等.一种时间依赖路网最小时间路径规划算法研究[J].计算机应用研究,2012,29(11):4148-4151.[11]高明霞,贺国光.一类点权网络的最小费用流问题[J].武汉理工大学学报:交通科学与工程版,2012,36(3):454-457.[12]谢政.网络算法与复杂性理论[M].2版.长沙:国防科技大学出版社,2003.[13]ZADEH N. A bad network problem for the simplex method and other minimum cost flow algorithms [J]. Mathematical Programming, 1973, 5(1): 255-266. |