FINDING MINIMUM-COST CIRCULATIONS BY CANCELING NEGATIVE CYCLES

[11] Ford L., 1962, FLOWS NETWORKS

[12] FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J]. JOURNAL OF THE ACM, 1987, 34 (03) : 596 - 615

[13] A CAPACITY-ROUNDING ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM - A DUAL FRAMEWORK OF THE TARDOS ALGORITHM [J]. MATHEMATICAL PROGRAMMING, 1986, 35 (03) : 298 - 308

[14] GABOW HN, IN PRESS SIAM J COMP

[15] AN O(N2(M+NLOGN)LOGN) MIN-COST FLOW ALGORITHM [J]. JOURNAL OF THE ACM, 1988, 35 (02) : 374 - 386

[16] A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM [J]. JOURNAL OF THE ACM, 1988, 35 (04) : 921 - 940

[17] GOLDBERG AV, 1987, TR374 MIT LAB COMP S

[18] GOLDBERG AV, 1987, 19TH P ACM S THEOR C, P7

[19] GOLDBERG AV, IN PRESS MATH OPER R

[20] KARP RM, 1978, DISCRETE MATH, V23, P309, DOI 10.1016/0012-365X(78)90011-0

[11] Ford L., 1962, FLOWS NETWORKS

[12] FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J]. JOURNAL OF THE ACM, 1987, 34 (03) : 596 - 615

[13] A CAPACITY-ROUNDING ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM - A DUAL FRAMEWORK OF THE TARDOS ALGORITHM [J]. MATHEMATICAL PROGRAMMING, 1986, 35 (03) : 298 - 308

[14] GABOW HN, IN PRESS SIAM J COMP

[15] AN O(N2(M+NLOGN)LOGN) MIN-COST FLOW ALGORITHM [J]. JOURNAL OF THE ACM, 1988, 35 (02) : 374 - 386

[16] A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM [J]. JOURNAL OF THE ACM, 1988, 35 (04) : 921 - 940

[17] GOLDBERG AV, 1987, TR374 MIT LAB COMP S

[18] GOLDBERG AV, 1987, 19TH P ACM S THEOR C, P7

[19] GOLDBERG AV, IN PRESS MATH OPER R

[20] KARP RM, 1978, DISCRETE MATH, V23, P309, DOI 10.1016/0012-365X(78)90011-0