Abstract
This work is on optimal assignation of resources. The proposed model is based on Net Flow Theory and here we give some indications for an efficient implementation of the model.
References
Aho, A.V.; Hopcroft, J.E.; Ullman, J.D. (1983) Data Structures and Algorithms. Addison-Wesley, Reading Mass.
Bazaraa, M.S.; Jarvis, J.J.; Sherali, H. (1990) Linear Programming and Network Flows, 2nd Edition. John Wiley & Sons, New York.
Bollobás, B. (1985) Graph Theory. Springer-Verlag, New York.
Brassard, G.; Bratley, P. (1987) Algorithmics. Prentice-Hall, Englewood-Cliffs, N. J.
Cormen, T.; Leiserson, C.; Rivest, R. (1990) Introduction to Algorithms. The MIT Press, Cambridge Mass.
Gill, P.E.; Murray, W.; Saunders, M.A.; Wright, M.H. (1986) Mantaining LU Factors of a General Sparse Matrix. Department of Operations Research, Stanford University, Calif.
Hillier, F.S.; Lieberman. G.J. (1991) Introducción a la Investigación de Operaciones. McGraw Hill, México.
Johnsonbaugh, R. (1988) Matemáticas Discretas. Grupo Editorial Iberoamérica, México.
Spiegel, M. (1983) Ecuaciones Diferenciales Aplicadas. Prentice-Hall, Bogotá.
Tenenbaum, A.M.; Augenstein, M.J. (1981) Estructuras de Datos en Pascal. Prentice-Hall, México.
Comments
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright (c) 1997 Juan Félix Ávila Herrera