1. J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the Association for Computing Machinery 19 (1972) 248–264.
2. L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, NJ, 1962).
3. M. Gondran and M. Minoux, Graphes et algorithmes (Eyrolles, Paris, 1979, English translation: Wiley. New York, 1984).
4. Internal Report;B. Jaumard,1983
5. J.L. Kennington and R.V. Helgason, Algorithms for network programming. (Wiley, New York, 1980).