RELAXATION METHODS FOR MINIMUM COST ORDINARY AND GENERALIZED NETWORK FLOW PROBLEMS

[1] AASHTIANI HA, 1976, MIT05576 OP RES CTR

[2] AJUJA RK, 1986, FAST SIMPLE ALGORITH

[3] Bertsekas D P, 1988, PARALLEL DISTRIBUTED

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

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

[6] RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (05) : 1219 - 1243

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

[8] A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (02) : 152 - 171

[9] BERTSEKAS DP, 1983, MIT LIDSP1339 LAB IN

[10] BERTSEKAS DP, 1971, 5TH P ANN PRINC C IN, P374

[1] AASHTIANI HA, 1976, MIT05576 OP RES CTR

[2] AJUJA RK, 1986, FAST SIMPLE ALGORITH

[3] Bertsekas D P, 1988, PARALLEL DISTRIBUTED

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

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

[6] RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (05) : 1219 - 1243

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

[8] A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM [J]. MATHEMATICAL PROGRAMMING, 1981, 21 (02) : 152 - 171

[9] BERTSEKAS DP, 1983, MIT LIDSP1339 LAB IN

[10] BERTSEKAS DP, 1971, 5TH P ANN PRINC C IN, P374