1. H.A. Aashtiani and T.L. Magnanti, “Implementing primal-dual network flow algorithms”, Operations Research Center Report 055-76, Massachusetts Institute of Technology, June 1976.
2. R.S. Barr, F. Glover and D. Klingman, “The alternative basis algorithm for assignment problems”,Mathematical Programming 13 (1977) 1.
3. D.P. Bertsekas, “A new algorithm for the assignment problem”,Mathematical Programming 21 (1981) 153–171.
4. D.P. Bertsekas and P. Tseng, “Relaxation methods for minimum cost network flow problems” Laboratory for Information & Decision Systems Report LIDS-P-1339, Massachusetts Institute of Technology, October 1983.
5. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, New Jersey, 1963).