1. http://www.mlit.go.jp/river/mlit_at_wcdrr/pdf/Forum2_en.pdf
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Upper Saddle River: Prentice Hall.
3. Arumugam, G. P., Augustine, J., Golin, M. J., & Srikanthan, P. (2014). A polynomial time algorithm for minimax-regret evacuation on a dynamic flow path. CoRR arXiv:1404.5448.
4. Averbakh, I., & Berman, O. (2000). Algorithms for the
robust 1-center problem on a tree. European Journal of Operational Research, 123(2), 292–302.
5. Belmonte, R., Higashikawa, Y., Katoh, N., & Okamoto, Y. (2015). Polynomial-time approximability of the k-Sink Location problem. CoRR arXiv:1503.02835.