1. R.S. Barr, F. Glover, and D. Klingman, “An improved version of the Out-of-Kilter Method and a comparative study of computer codes,” Mathematical Programming, vol. 7, no. 1, 1974, 60–87.
2. G.E. Bennington, “An efficient minimal cost flow algorithm,” OR Report 75, North Carolina State University, Raleigh, North Carolina, June 1972.
3. G. Bradley, G. Brown, and G. Graves, “A comparison of storage structure for primal network codes,” presented at ORSA/TIMS conference, Chicago, April 1975.
4. R.J. Clasen, “The numerical solution of network problems using the Out-of-Kilter algorithm,” RAND Corporation Memorandum RM-5456-PR, Santa Monica, California, March 1968.
5. F. Glover, D. Karney, and D. Klingman, “Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem,” CCS Re search Report 105, Center for Cybernetic Studies, University of Texas, Austin, Texas 78712.