CALCULATING MAXIMAL FLOWS IN A NETWORK WITH POSITIVE GAINS

被引：14

作者：

GRINOLD, RC ^{[1
]}

机构：

[1] UNIV CALIF,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1287/opre.21.2.528

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：528 / 541

页数：14

共 9 条

[1]

Ford Lester R., 1962, FLOWS NETWORKS

[2]

JARVIS JJ, 1970, MAXIMAL FLOW GAINS T

[3] OPTIMAL FLOW THROUGH NETWORKS WITH GAINS [J].

JEWELL, WS .

[4]

JOHNSON E, 1965, 651 U CAL OPER RES C, P30

[5] NETWORKS AND BASIC SOLUTIONS [J].

JOHNSON, EL .

[6]

MARKOWITZ HM, 1954, CONCEPTS COMPUTING P

[7]

MINIEKA E, 1970, SELECTED GRAPH THEOR

[8] OPTIMUM FLOWS IN GENERAL COMMUNICATION NETWORKS [J].

ONAGA, K .

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1967, 283 (04) :308-&

YEN, JY .