EFFECTIVE SUBGRADIENT PROCEDURE FOR MINIMAL COST MULTICOMMODITY FLOW PROBLEMS

被引：38

作者：

KENNINGTON, J ^{[1
]}

SHALABY, M ^{[1
]}

机构：

[1] SO METHODIST UNIV,DALLAS,TX 75222

来源：

关键词：

D O I：

10.1287/mnsc.23.9.994

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：994 / 1004

页数：11

共 53 条

[1] MAXIMAL BIFLOW IN AN UNDIRECTED NETWORK
ARINAL, JC
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1969, 13 (04) : 373 - &
[2] BAZARAA MS, 1973, INFEASIBILITY PRICIN
[3] BAZARAA MS, 1974, TRAVELING SALESMAN P
[4] Bellemore M., 1971, TRANSPORT SCI, V5, P36
[5] BRADLEY SP, 1965, ORC6535 U CAL OP RES
[6] CARTER EC, 1963, HIGHWAY RES RECORD, P84
[7] Charnes A., 1961, THEORY TRAFFIC FLOW, P85
[8] Chen H., 1974, Computers & Operations Research, V1, P437, DOI 10.1016/0305-0548(74)90062-8
[9] CLARKE SH, 1968, J SOCIOECONOMIC PLAN, V1, P259
[10] OPTIMAL MULTICOMMODITY NETWORK FLOWS WITH RESOURCE ALLOCATION
CREMEANS, JE
SMITH, RA
TYNDALL, GR
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1970, 17 (03): : 269 - &