Analysis of the Degree of Parallelism for Non-Polynomial, Polynomial, Strongly Polynomial Algorithms for Solving the Minimum Cost Flow Problem
The minimum cost flow problem (Mcfp), (or the two equivalent transportation and the minimum cost circulation), plays a crucial role in the network flow optimization mainly because other flow problems can be considered special cases of it.
Unable to display preview. Download preview PDF.
- Bertsekas, D.P., and P. Tseng. 1987. Relax: A Code for Linear Network Flow Problems. In B. Simeone et al. (eds), FORTRAN Codes for Network Optimization, Annals of Operation Research Google Scholar
- Bertsekas, D.P., and P. Tseng. 1988. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res 36, 93–114Google Scholar
- Edmonds, J., and R.M. Karp. 1972. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19, 248–264Google Scholar
- Galil, Z., and E. Tardos. 1986. An O(n2(m + n logn) log n) Min-Cost Flow Algorithm. Proc 27th Annual Symp on the Found. of Comp. Sci., 136–146Google Scholar
- Goldberg, A.V., and R.E. Tarjan. 1988. Finding Minimum-Cost Circulation by Canceling Negative Cycles. Proc. 20th ACM Symp. on the Theory of Comp., 388–397.Google Scholar
- Grigoriadis, M.D. 1986. An Efficient Implementation of the Network Simplex Method. Math. Prog. Study 26, 83–111Google Scholar
- Klein, M. 1967. A Primal Method for the Minimal Cost Flow. Man. Sci 14, 205–220Google Scholar
- Orlin, J.B. 1985. On the Simplex Algorithm for Networks and Generalized Networks. Math. Prog. Study 24, 166–178Google Scholar
- Orlin, J.B. 1988. A Faster Strongly Polynomial Minimum Cost Flow Proc. 20th ACM Symp. on the Theory of Comp., 377–387.Google Scholar
- Spera, C. 1989. A Parallel Network AlgorithmEURO X 25-30 June 1989, Beograd, Yug.Google Scholar
- Spera, C and L. Vettorazzo. 1990. A Parallel Algorithm for Solving Minimum Cost Flow Problems. Working Paper #52 Istituto di Matematica, Facoltè di Scienze Economiche e Bancarie, Università di Sien Google Scholar