A PRIMAL SIMPLEX VARIANT FOR THE MAXIMUM-FLOW PROBLEM

被引：4

作者：

GLOVER, F

KLINGMAN, D

MOTE, J

WHITMAN, D

机构：

[1] UNIV TEXAS,DEPT OPERAT RES & COMP SCI,AUSTIN,TX 78712

[2] COMP SCI CORP,ARLINGTON,VA 22202

来源：

NAVAL RESEARCH LOGISTICS | 1984年 / 31卷 / 01期

关键词：

D O I：

10.1002/nav.3800310107

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：41 / 61

页数：21

共 15 条

[1]

BARR R, 1979, INFOR, V17, P16

[2]

BAYER G, 1968, COMMUNICATIONS ACM, V11, P11

[3]

CHEUNG T, 1978, 7807 U OTT DEP COMP

[4]

DANTZIG GB, 1956, ANN MATH STUD, P215

[5] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[6] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[7]

Ford L. R., 1962, FLOWS NETWORKS

[8]

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

[9]

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

[10]

Fulkerson D.R., 1955, NAV RES LOGIST Q, V2, P277

← 1 2 →