An Introduction to Polymatroidal Network Flows

  • Eugene L. Lawler
Part of the International Centre for Mechanical Sciences book series (CISM, volume 266)


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.


Network Flow Capacity Function Multiprocessor Schedule Network Flow Model Feasible Flow 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Edmonds, J., Minimum partition of a matroid into independent subsets, J. Res. NBS, 69B, 67–72, 1965.MATHMathSciNetGoogle Scholar
  2. 2.
    Edmonds, J., Fulkerson, D.R., Transversals and matroid partition, J. Res. NBS, 69B, 147–153, 1965.MATHMathSciNetGoogle Scholar
  3. 3.
    Edmonds, J., Giles, R., A min-max relation for submodular functions on graphs, Annals Discrete Math., 1, 185–204, 1977.CrossRefMathSciNetGoogle Scholar
  4. 4.
    Hassin, R., On network flows, Ph.D. thesis, Yale University, May, 1978.Google Scholar
  5. 5.
    Horn, W., Some simple scheduling algorithms, Naval Res. Logist. Quart., 21, 177–185, 1974.CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Lawler, E.L., Matroid intersection algorithms, Math. Programming, 9, 31–56, 1975.CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Lawler, E.L., Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston, 1976.MATHGoogle Scholar
  8. 8.
    Lawler, E.L., Labetoulle, J., On preemptive scheduling of unrelated parallel processors by linear programming, J. ACM, 25, 612–619, 1978.CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Martel, C.U., Generalized network flows with an application to multiprocessor scheduling, Ph.D. thesis, University of California at Berkeley, May, 1980.Google Scholar

Copyright information

© Springer-Verlag Wien 1981

Authors and Affiliations

  • Eugene L. Lawler
    • 1
  1. 1.Computer Science DivisionUniversity of California BerkeleyUSA

Personalised recommendations