DUAL COORDINATE STEP METHODS FOR LINEAR-NETWORK FLOW PROBLEMS

被引:46
作者
BERTSEKAS, DP [1 ]
ECKSTEIN, J [1 ]
机构
[1] MIT,OPERAT RES CTR,CAMBRIDGE,MA 02139
关键词
D O I
10.1007/BF01589405
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:203 / 243
页数:41
相关论文
共 45 条
[1]  
AHUJA RK, 1987, COMMUNICATION NOV
[2]  
AHUJA RK, IN PRESS OPERATIONS
[3]  
AHUJA RK, 1987, MIT196687 SLOAN SCH
[4]   COMPLEXITY OF NETWORK SYNCHRONIZATION [J].
AWERBUCH, B .
JOURNAL OF THE ACM, 1985, 32 (04) :804-823
[5]  
BERTSEKAS D, 1985, 24 IEEE C DEC CONTR, P1703
[6]  
Bertsekas D. P., 1988, Annals of Operations Research, V14, P105, DOI 10.1007/BF02186476
[7]  
Bertsekas D.P., 1997, PARALLEL DISTRIBUTED, V2
[8]   A UNIFIED FRAMEWORK FOR PRIMAL-DUAL METHODS IN MINIMUM COST NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1985, 32 (02) :125-145
[9]   RELAXATION METHODS FOR MINIMUM COST ORDINARY AND GENERALIZED NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP ;
TSENG, P .
OPERATIONS RESEARCH, 1988, 36 (01) :93-114
[10]   DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP ;
ELBAZ, D .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (01) :74-85