[1]

R.G. Busacker and P.J. Gowen, “A procedure for determining a family of minimal-cost network flow patterns”, Operations Research Office, The Johns Hopkins University, Baltimore, Md., No. ORO 15 (1961).

[2]

G.B. Dantzig,*Linear programming and extensions* (Princeton University Press, Princeton, N.J., 1962).

[3]

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.

[4]

L. Ford and D.R. Fulkerson, “A primal dual algorithm for the capacitated Hitchcock problem”,*Naval Research Logistics Quarterly* 4 (1957) 47–54.

[5]

L. Ford and D.R. Fulkerson,*flows in networks* (Princeton University Press, Princeton, N.J., 1962).

[6]

T.C. Hu,*Integer programming and network flows* (Addison-Wesley, Reading, Mass., 1969).

[7]

V.L. Klee and G.J. Minty, “How good is the simplex algorithm”, Boeing Math. Note No. 643 (February 1970).

[8]

M. Klein, “A primal method for minimal cost flows”,*Management Science* 14 (1967) 205–220.

[9]

N. Tomizawa, “On some techniques useful for solution of transportation network problems”,*Networks* 1 (1972) 173–194.

[10]

H.M. Wagner, “On a class of capacitated transportation problems”,*Management Science* 5 (1959) 304–318.

[11]

N. Zadeh, “Theoretical efficiency of the Edmonds—Karp algorithm for computing maximal flows”,*Journal of the Association for Computing Machinery* 19 (1972) 184–192.

[12]

N. Zadeh, “Theoretical efficiency and partial equivalence of minimum cost flow algorithms: A bad network problem for the simplex method”, Operations Research Center, University of California, Berkeley, Calif., No. ORC 72-7 (1972).

[13]

N. Zadeh, “More pathological examples for network flow problems”,*Mathematical programming* 5 (1973) 217–224.