Earliest arrival flows on series‐parallel graphs
暂无分享,去创建一个
[1] Mechthild Steiner,et al. A Survey of Earliest Arrival Flows and a Study of the Series-Parallel Case , 2009 .
[2] W. L. Wilkinson,et al. An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..
[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[4] D. R. Fulkerson,et al. Constructing Maximal Dynamic Flows from Static Flows , 1958 .
[5] Éva Tardos,et al. Polynomial time algorithms for some evacuation problems , 1994, SODA '94.
[6] Edward Minieka,et al. Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..
[7] Martin Skutella,et al. Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[8] Martin Skutella,et al. Quickest Flows Over Time , 2007, SIAM J. Comput..
[9] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..
[10] Martin Skutella,et al. Multicommodity flows over time: Efficient algorithms and complexity , 2003, Theor. Comput. Sci..
[11] David Gale,et al. Transient flows in networks. , 1959 .
[12] Stevanus Adrianto Tjandra. Dynamic network optimization with application to the evacuation problem , 2003 .
[13] Gerhard J. Woeginger,et al. Minimum-cost dynamic flows: The series-parallel case , 2004, Networks.
[14] Peter Brucker,et al. Minimum cost flow algorithms for series-parallel networks , 1985, Discret. Appl. Math..
[15] Martin Skutella,et al. Earliest Arrival Flows with Multiple Sources , 2009, Math. Oper. Res..
[16] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .