SYNTHESIS OF A COMMUNICATION NETWORK

[1] BENDERS JF, 1960, THESIS UTRECHT U

[2] BERGE C, 1962, THEORY GRAPHS, P138

[3] SYNTHESIS OF A COMMUNICATION NET [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (03) : 311 - 320

[4] FARKAS J, 1901, J REINE ANGEW MATH, V124, P1

[5] Ford Lester R., 1962, FLOWS NETWORKS

[6] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J]. MANAGEMENT SCIENCE, 1958, 5 (01) : 97 - 101

[7] Ford LR., 1957, CAN J MATH, V9, P210, DOI [10.4153/CJM-1957-024-0, DOI 10.4153/CJM-1957-024-0]

[8] AN APPLICATION OF GENERALIZED LINEAR PROGRAMMING TO NETWORK FLOWS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (02): : 260 - 283

[9] MULTI-TERMINAL NETWORK FLOWS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04): : 551 - 570

[10] GOMORY RE, 1963, P S APPLIED MATH, V15

[1] BENDERS JF, 1960, THESIS UTRECHT U

[2] BERGE C, 1962, THEORY GRAPHS, P138

[3] SYNTHESIS OF A COMMUNICATION NET [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1960, 4 (03) : 311 - 320

[4] FARKAS J, 1901, J REINE ANGEW MATH, V124, P1

[5] Ford Lester R., 1962, FLOWS NETWORKS

[6] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J]. MANAGEMENT SCIENCE, 1958, 5 (01) : 97 - 101

[7] Ford LR., 1957, CAN J MATH, V9, P210, DOI [10.4153/CJM-1957-024-0, DOI 10.4153/CJM-1957-024-0]

[8] AN APPLICATION OF GENERALIZED LINEAR PROGRAMMING TO NETWORK FLOWS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (02): : 260 - 283

[9] MULTI-TERMINAL NETWORK FLOWS [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04): : 551 - 570

[10] GOMORY RE, 1963, P S APPLIED MATH, V15