1. G. B. Dantzig,Linear Programming and Extensions (1963), Princeton University Press, Princeton, New Jersey.
2. M. Florian, M. Rossin Arthiat, D. De Werra,A property of Minimum Concave Cost Flows in Capacitated Networks, Canad. J. Operations Res.9 (1971), 293–304.
3. J. K. Hartman, L. S. Lasdon,A Generalized Upper Bounding Algorithm for Multicommodity Network flow Problems, Networks1 (1972), 333–354.
4. E. L. Johnson,Networks and Basic Solutions, Operations Res14 (1966), 619–623.
5. S. F. Maier,A Compact Inverse Scheme Applied to a Multicommodity Network with Resource Constraints. Optimization Methods (174), R. W. Cottle & J. Krarup ed., The English University Press.