1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 32–44. IEEE, Los Alamitos (1999)
2. Baumann, N., Skutella, M.: Earliest arrival flows with multiple sources. Mathematics of Operations Research 34, 499–512 (2009)
3. Lecture Notes in Computer Science;L. Epstein,2010
4. Fleischer, L.: Faster algorithms for the quickest transshipment problem with zero transit times. In: Proceedings of the 9th Annual Symposium on Discrete Algorithms (SODA 1998), pp. 147–156 (1998)
5. Gale, D.: Transient flows in networks. Michigan Mathematical Journal 6, 59–63 (1959)