SEND-AND-SPLIT METHOD FOR MINIMUM-CONCAVE-COST NETWORK FLOWS

被引：120

作者：

ERICKSON, RE

MONMA, CL

VEINOTT, AF

机构：

[1] STANFORD UNIV,DEPT OPERAT RES,STANFORD,CA 94305

[2] BELL COMMUN RES,COMBINATOR & OPTIMIZAT RES GRP,MORRISTOWN,NJ 07960

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1987年 / 12卷 / 04期

关键词：

D O I：

10.1287/moor.12.4.634

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

MATHEMATICAL PROGRAMMING

引用

页码：634 / 664

页数：31

共 58 条

[1] RECTILINEAR STEINER TREES - EFFICIENT SPECIAL-CASE ALGORITHMS [J].

AHO, AV ;

GAREY, MR ;

HWANG, FK .

NETWORKS, 1977, 7 (01) :37-58

[2] A NEW OPTIMIZATION METHOD FOR LARGE-SCALE FIXED CHARGE TRANSPORTATION PROBLEMS [J].

BARR, RS ;

GLOVER, F ;

KLINGMAN, D .

OPERATIONS RESEARCH, 1981, 29 (03) :448-463

[3]

BEASLEY JE, 1983, 1982 IMP COLL DEP MA

[4]

Bellman R., 1958, Q APPL MATH, V16, P87

[5]

BIENSTOCK D, 1986, IN PRESS SIAM J COMP

[6]

CAHN AS, 1948, B AM MATH SOC, V54, P1073

[7] USING SHORTEST PATHS IN SOME TRANSSHIPMENT PROBLEMS WITH CONCAVE COSTS [J].

DAENINCK, G ;

SMEERS, Y .

MATHEMATICAL PROGRAMMING, 1977, 12 (01) :18-25

[8]

DANTZIG GB, 1968, AM MATH SOC LECTURES, V11, P335

[9]

Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390

[10]

DREYFUS SE, 1971, NETWORKS, V1, P195

← 1 2 3 4 5 6 →