Abstract
In the “classical” network flow model, flows are constrained by the capacities of individual arcs. In the “polymatroidal” network flow model, flows are constrained by the capacities of sets of arcs. Yet the essential features of the classical model are retained: the augmenting path theorem, the integral flow theorem, and the max-flow min-cut theorem all yield to straightforward generalization. In this paper we provide an introduction to the theory of polymatroidal network flows, with the objective of showing that this theory provides a satisfying generalization and unification of both classical network flow theory and much of the theory of matroid optimization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Edmonds, J., Minimum partition of a matroid into independent subsets, J. Res. NBS, 69B, 67–72, 1965.
Edmonds, J., Fulkerson, D.R., Transversals and matroid partition, J. Res. NBS, 69B, 147–153, 1965.
Edmonds, J., Giles, R., A min-max relation for submodular functions on graphs, Annals Discrete Math., 1, 185–204, 1977.
Hassin, R., On network flows, Ph.D. thesis, Yale University, May, 1978.
Horn, W., Some simple scheduling algorithms, Naval Res. Logist. Quart., 21, 177–185, 1974.
Lawler, E.L., Matroid intersection algorithms, Math. Programming, 9, 31–56, 1975.
Lawler, E.L., Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, 1976.
Lawler, E.L., Labetoulle, J., On preemptive scheduling of unrelated parallel processors by linear programming, J. ACM, 25, 612–619, 1978.
Martel, C.U., Generalized network flows with an application to multiprocessor scheduling, Ph.D. thesis, University of California at Berkeley, May, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Wien
About this chapter
Cite this chapter
Lawler, E.L. (1981). An Introduction to Polymatroidal Network Flows. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2748-3_7
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81626-4
Online ISBN: 978-3-7091-2748-3
eBook Packages: Springer Book Archive