NETWORK FLOW PROBLEMS WITH ONE SIDE CONSTRAINT - A COMPARISON OF 3 SOLUTION METHODS

被引：16

作者：

BELLINGSEIB, K

MEVERT, P

MULLER, C

机构：

[1] Freie Univ Berlin, Berlin, West Ger, Freie Univ Berlin, Berlin, West Ger

来源：

关键词：

D O I：

10.1016/0305-0548(88)90022-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：381 / 394

页数：14

共 23 条

[1] A LAGRANGEAN-RELAXATION METHOD FOR THE CONSTRAINED ASSIGNMENT PROBLEM
AGGARWAL, V
[J]. COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (01) : 97 - 106
[2] PRIMAL SIMPLEX NETWORK CODES - STATE-OF-ART IMPLEMENTATION TECHNOLOGY
ALI, AI
HELGASON, RV
KENNINGTON, JL
LALL, HS
[J]. NETWORKS, 1978, 8 (04) : 315 - 339
[3] BARR R, 1979, INFOR, V17, P16
[4] Bazaraa MS., 2008, LINEAR PROGRAMMING N
[5] DESIGN AND IMPLEMENTATION OF LARGE-SCALE PRIMAL TRANSSHIPMENT ALGORITHMS
BRADLEY, GH
BROWN, GG
GRAVES, GW
[J]. MANAGEMENT SCIENCE, 1977, 24 (01) : 1 - 34
[6] CHARNES A, 1961, MANAGEMENT MODELS IN, V2
[7] CHARNES A, 1961, MANAGEMENT MODELS IN, V1
[8] PRIMAL ALGORITHM FOR SOLVING A CAPACITATED NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR CONSTRAINTS
CHEN, S
SAIGAL, R
[J]. NETWORKS, 1977, 7 (01) : 59 - 79
[9] DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS
DANTZIG, GB
WOLFE, P
[J]. OPERATIONS RESEARCH, 1960, 8 (01) : 101 - 111
[10] Glover F., 1975, ACM Transactions on Mathematical Software, V1, P47, DOI 10.1145/355626.355634