MULTI-COMMODITY NETWORK FLOWS

被引：254

作者：

HU, TC

机构：

来源：

关键词：

D O I：

10.1287/opre.11.3.344

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：344 / 360

页数：17

共 11 条

[1]

BUSACKER RG, 1961, ORO15 TECH PAP

[2]

FORD L, COMMUNICATION

[3]

Ford L. R., 1956, CAN J MATH, V8, P399, DOI [10.4153/CJM-1956-045-5, DOI 10.4153/CJM-1956-045-5]

[4]

Ford Lester R., 1962, FLOWS NETWORKS

[5] A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J].

FORD, LR ;

FULKERSON, DR .

[6]

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

[7]

GOMORY RE, 1962, SIAM, V10, P260

[8]

GOMORY RE, 1961, SIAM J APPL MATH, V9, P551

[9] SIMULTANEOUS FLOWS THROUGH A COMMUNICATION NETWORK [J].

HAKIMI, SL .

IRE TRANSACTIONS ON CIRCUIT THEORY, 1962, CT 9 (02) :169-&

[10]

JEWELL WS, 1958, MIT8 INT TECH REP