1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. C.R. Coullard, B.A. Gamble, J. Liu, The k-walk polyhedron, in: Du, Ding-Zhu et al. (Eds.), Advances in Optimization and Approximation, Nonconvex Optim. Appl., vol. 1, Kluwer Academic Publishers, Dordrecht, 1994, p. 9–29.
3. L. Gouveia, Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints. Faculdade de Ciéncias da Universidade de Lisboa, Centro de investigação operacional, Lisboa, Portugal. Report 2, 1996.
4. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
5. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.