MINIMUM-COST MULTICOMMODITY NETWORK FLOWS

被引：96

作者：

TOMLIN, JA

机构：

来源：

关键词：

D O I：

10.1287/opre.14.1.45

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：45 / &

共 11 条

[1]

CHARNES A, THEORY TRAFFIC FLOW

[2]

Dantzig G, LINEAR PROGRAMMING E, V2020 5th

[3] THE DECOMPOSITION ALGORITHM FOR LINEAR-PROGRAMS [J].

DANTZIG, GB ;

WOLFE, P .

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

FORD, LR ;

FULKERSON, DR .

[5] SYNTHESIS OF A COMMUNICATION NETWORK [J].

GOMORY, RE ;

HU, TC .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (02) :348-369

[6]

GOMORY RE, 1963, P S APPLIED MATH, V15

[7]

HERMAN R, THEORY TRAFFIC FL ED

[8] MULTI-COMMODITY NETWORK FLOWS [J].

HU, TC .

[9]

JORGENSEN NO, JUL ITTE GRAD REP

[10]

TANG DT, 1964, IEEE T, VCT11