1. A. Ali, R. Helgason, J. Kennington and H. Lall, “Solving multi-commodity network flow problems”, Technical Report IEOR 77015, Southern Methodist University (1977).
2. Analysis, Research, and Computation, Inc., “Development and computational testing on a capacitated primal simplex transshipment code”, ARC Technical Research Report, Austin, TX.
3. A.A. Assad, “Multicommodity network flows—Computational experience”, Working Paper No. OR 058-76, Massachusetts Institute of Technology (1976).
4. M. D. Bakes, “Solution for special linear programming problems with additional constraints”, Operational Research Quarterly 17 (4)(1966) 425–445.
5. R. Barr, F. Glover and D. Klingman, “Enhancements of spanning tree labeling procedures for network optimization”, INFOR 17 (1) (1979).