Abstract
In this paper flows in regular matroids M are considered and three algorithms are described for determining maximal matroid flows with minimal costs. The first algorithms starts with an arbitrary maximal matroid flow and reduces its costs by finding negative circuits in M. The second builds up a min cost matroid flow by starting with the zero flow and performing augmentations along shortest augmenting circuits. The last algorithm works in regular matroids with special structures. By a sequence of admissible transformations an optimal matroid flow can be found. This transformation method can be viewed as a generalization of the Hungarian Method for solving linear assignment problems. The arguments used in the paper are of pure combinatorial kind and don’t make any use of the representation of the regular matroid M by a totally unimodular matrix.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.E. Burkard, “A general Hungarian method for the algebraic transportation problem”, Discrete Mathematics 22 (1978) 219–232.
R.E. Burkard, H. Hamacher and U. Zimmermann, “Einige Bemerkungen zum allgemeinen Flußproblem”, Operations Research Verfahren 23 (1977) 252–254.
P. Camion, “Modules unimodulaires”, Journal of Combinatorial Theory 4 (1968) 301–362.
J. Edmonds and R. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the ACM 19 (1972) 218–264.
D.R. Fulkerson, “Networks, frames, and blocking systems”, in: G.B. Dantzig and A. F. Veinott, Jr., eds., Mathematics of the decision sciences, I. (Americal Mathematical Society, Providence, RI, 1968) pp. 303–345.
L.G. Hačjian, “A polynomial algorithm in linear programming”, Soviet Mathematics Doklady 20 (1979) 191–194.
H. Hamacher, “Algebraic flows in regular matroids”, Discrete Applied Mathematics 2 (1980) 27–38.
H. Hamacher, “Algebraische Flußprobleme in regulären Matroiden”, Dissertation, Universität zu Köln (Köln, 1980).
G.J. Minty, “On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming”, Journal of Mathematics and Mechanics 15 (1966) 485–520.
R.T. Rockafellar, “The elementary vectors of a subspace of R n”, in: B.C. Bose and T.A. Dowling, eds., Combinatorial mathematics and its applications (University of North Carolina Press, Chapel Hill, NC, 1969) pp. 104–127.
P.D. Seymour, “The matroids with the max-flow min-cut property”, Journal of Combinatorial Theory, Series B, 23 (1977) 189–222.
P.D. Seymour, “Decomposition of regular matroids”, Report CORR 79-9, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada.
W.T. Tutte, “A homotopic theorem for matroids I, II”, Transactions of the American Mathematical Society 88 (1958) 144–174.
D.J.A. Welsh, Matroid theory (Academic Press, London, 1976).
N. Zadeh, “More pathological examples for network flow problems”, Mathematical Programming 5 (1973) 217–224.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 The Mathematical Programming Society
About this chapter
Cite this chapter
Burkard, R.E., Hamacher, H. (1981). Minimal cost flows in regular matroids. In: König, H., Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach. Mathematical Programming Studies, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120919
Download citation
DOI: https://doi.org/10.1007/BFb0120919
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00805-4
Online ISBN: 978-3-642-00806-1
eBook Packages: Springer Book Archive