Abstract
This paper is concerned with the minimum cost flow problem. It is shown that the class of dual algorithms which solve this problem consists of different variants of a common general algorithm. We develop a new variant which is, in fact, a new form of the ‘primal-dual algorithm’ and which has several interesting properties. It uses, explicitly only dual variables. The slope of the change in the (dual) objective is monotone. The bound on the maximum number of iterations to solve a problem with integral bounds on the flow is better than bounds for other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.S. Bazarraa and J.J. JarvisLinear programming and network flows (Wiley, New York, 1977).
R.G. Busacker and T.L. Saaty,Finite graphs and networks: An introduction with applications (McGraw Hill, New York, 1965).
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
D.R. Fulkerson, “An Out-of-Kilter Method for minimal cost flow problems”,Journal of the Society of Industrial and Applied Mathematics 9 (1961) 18–27.
F. Glover, D. Karney and D. Klingman, “Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems”,Networks 4 (1974) 191–212.
F. Glover, D. Karney, D. Klingman and A. Napier, “A computational study of start procedures, basis change criteria and solution algorithms for transportation problems,”Management Science 20 (1974) 793–819.
A.J. Hoffman, “Some recent applications of the theory of linear inequalities to extremal combinatiorial analysis”, in: R. Bellman and M. Hall Jr. (eds.),Proceedings of symposia in applied mathematics, Vol. X,Combinatorial analysis (American Mathematical Society, Providence, RI, 1960) 113–127.
T.C. Hu,Integer programming and network flows (Addison-Wesley, Reading, MA, 1969).
P.A. Jensen and J.W. Barnes,Network flow programming (Wiley, New York, 1980).
E.L. Johnson, Chapter II-4, in: S.E. Elmaghraby and J.J. Moder (eds.),Handbook of operations research, foundations and fundamentals (Van Nostrand Reinhold, New York, 1978).
M. Klein, “A primal method for minimal cost flows”,Management Science 14 (1967) 205–220.
J.F. Shapiro, “A note on the primal-dual and out-of-kilter algorithms for network optimization problems”,Networks 7 (1977) 81–88.
M. Simonnard,Linear programming, (Prentice-Hall, Englewood Cliffs, NJ, 1966).
N. Zadeh, “A bad network problem for the simplex method and other minimum cost-flow algorithms”,Mathematical Programming 5 (1973) 255–266.
Author information
Authors and Affiliations
Additional information
This paper is part of the author's doctoral dissertation submitted at Yale University.
Rights and permissions
About this article
Cite this article
Hassin, R. The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. Mathematical Programming 25, 228–239 (1983). https://doi.org/10.1007/BF02591772
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591772