RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS

[1] [Anonymous], 1971, COMPUTATIONAL METHOD

[2] A UNIFIED FRAMEWORK FOR PRIMAL-DUAL METHODS IN MINIMUM COST NETWORK FLOW PROBLEMS [J]. MATHEMATICAL PROGRAMMING, 1985, 32 (02) : 125 - 145

[3] DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (01) : 74 - 85

[4] BERTSEKAS DP, 1973, SIAM J CONTROL, V11, P637, DOI 10.1137/0311049

[5] BERTSEKAS DP, 1986, LIDS P1606 MIT REP

[6] BERTSEKAS DP, 1985, LIDS P1462 MIT REP

[7] BERTSEKAS DP, 1986, 25TH P C DEC CONTR A

[8] COTTLE RW, 1982, MATH PROGRAM STUD, V17, P126

[9] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[10] Ford L., 1962, FLOWS NETWORKS

[1] [Anonymous], 1971, COMPUTATIONAL METHOD

[2] A UNIFIED FRAMEWORK FOR PRIMAL-DUAL METHODS IN MINIMUM COST NETWORK FLOW PROBLEMS [J]. MATHEMATICAL PROGRAMMING, 1985, 32 (02) : 125 - 145

[3] DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (01) : 74 - 85

[4] BERTSEKAS DP, 1973, SIAM J CONTROL, V11, P637, DOI 10.1137/0311049

[5] BERTSEKAS DP, 1986, LIDS P1606 MIT REP

[6] BERTSEKAS DP, 1985, LIDS P1462 MIT REP

[7] BERTSEKAS DP, 1986, 25TH P C DEC CONTR A

[8] COTTLE RW, 1982, MATH PROGRAM STUD, V17, P126

[9] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[10] Ford L., 1962, FLOWS NETWORKS