-
AHUJA, R.K., MAGNANTI, T.L. and ORLIN, J.B. (1993) Network Flow Theory, Algorithms, and Applications. Prentice-Hall, Englewood-Cliffs, NJ.
-
BELLMAN, R. (1952) On the theory of dynamic programming. Proceedings of the National Academy of Sciences, 38, 716-719.
-
BELLMAN, R. (1957) Dynamic Programming. Princeton University Press, Princeton. NJ.
-
BELLMAN, R. (1958) On a routing problem. Quarterly of Applied Mathematics 16 (1), 87-90.
-
BERGE, C. (1958) Theorie des Graphes et ses Applications. Dunod, Paris.
-
BERTSEKAS, D. (1991) Linear Network Optimization. The MIT Press, Cambridge, MA.
-
BIRD, R. and DE MOOR, O. (1997) The Algebra of Programming. Prentice Hall.
-
BRASSARD, G. and BRATLEY, P. (1988) Algorithmics. Prentice-Hall, Englewood Cliffs, NJ.
-
GORMEN, T.H., LEISERSON, C.E. and RIVEST, R.L. (1990) Introduction to Algorithms. The MIT Press, Cambride, MA.
-
DAELLENBACH, H.G., GEORGE, J.A. and MCNICKLE, B.C. (1983) Introduction to Operations Research Techniques, 2nd Edition. Allyn and Bacon. Boston.