Skip to main content
SpringerLink
Log in

Blocking and anti-blocking pairs of polyhedra

  • Published:
Mathematical Programming Submit manuscript

Abstract

Some of the main notions and theorems about blocking pairs of polyhedra and antiblocking pairs of polyhedra are described. The two geometric duality theories conform in many respects, but there are certain important differences. Applications to various combinatorial extremum problems are discussed, and some classes of blocking and anti-blocking pairs that have been explicitly determined are mentioned.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Berge, “Färbung von Graphen, deren sämtliche bzw deren ungerade Kreise starr sind (Zusammenfassung),”Wiss. Z. Martin-Luther-Univ. Halle Wittenberg Math. Natur. Reihe (1961) 114.

  2. C. Berge, “Some classes of perfect graphs,” in:Graph theory and theoretical physics, Ed. F. Harary (Academic Press, New York, 1967).

    Google Scholar 

  3. C. Berge, “The rank of a family of sets and some applications to graph theory,” in:Recent progress in combinatorics, Ed. W.T. Tutte (Academic Press, New York, 1969).

    Google Scholar 

  4. R.P. Dilworth, “A decomposition theorem for partially ordered sets,”Annals of Mathematics 51 (1950) 161.

    Google Scholar 

  5. R.J. Duffin, “The extremal length of a network,”J. Math. Anal. Appl. 5 (1962) 200.

    Google Scholar 

  6. J. Edmonds, “Paths, trees and flowers,”Canadian Journal of Mathematics 17 (1965) 499.

    Google Scholar 

  7. J. Edmonds, “Maximum matching and a polyhedron with (0, 1)-vertices,”J. Research National Bureau of Standards 69B (1965) 125.

    Google Scholar 

  8. J. Edmonds, “Minimum partition of a matroid into independent sets,”J. Research National Bureau of Standards 69B (1965) 67.

    Google Scholar 

  9. J. Edmonds, “Lehman s switching game and a theorem of Tutte and Nash-Williams,”J. Research National Bureau of Standards 69B (1965) 73.

    Google Scholar 

  10. J. Edmonds, “Matroids and the greedy algorithm” (lecture, Princeton, August 1967).

  11. J. Edmonds, “Optimum branchings,” in:Mathematics of the decision sciences, Lectures in applied mathematics, Eds. G.B. Dantzig and A.F. Veinott, Jr., Vol. 11 (American Mathematical Society, 1968) p. 346.

  12. J. Edmonds, “Submodular functions, matroids, and certain polyhedra,” in:Combinatorial structures and their applications, Eds. R. Guy, H. Hanani, N. Sauer, J. Schonheim (Gordon and Breach, 1970) p. 69.

  13. J. Edmonds, “Edge-disjoint branchings” (to appear).

  14. J. Edmonds and D.R. Fulkerson, “Bottleneck extrema,”J. Combinational Theory 8 (1970) 299.

    Google Scholar 

  15. L.R. Ford, Jr., and D.R. Fulkerson,Flows in networks (Princeton University Press, 1962).

  16. D.R. Fulkerson, “The maximum number of disjoint permutations contained in a matrix of zeros and ones,”Canadian Journal of Mathematics 16 (1964) 729.

    Google Scholar 

  17. D.R. Fulkerson, “Networks, frames, blocking systems,” in:Mathematics of the decision sciences, lectures in applied mathematics, Eds. G.B. Dantzig and A.F. Veinott, Jr., (American Mathematical Society, 1968) p. 303.

  18. D.R. Fulkerson, “Blocking polyhedra,” in:Graph theory and its applications, Ed. B. Harris (Academic Press, 1970) p. 93.

  19. D.R. Fulkerson, “Anti-blocking polyhedra,” to appear inJ. Combinational Theory.

  20. D.R. Fulkerson, “Disjoint common partial transversals of two families of sets,” in:Studies in pure mathematics, Ed. L. Mirsky (Academic Press, 1971) p. 107.

  21. T.C. Hu, “Multi-commodity network flows,”Operations Research 11 (1963) 344.

    Google Scholar 

  22. E.L. Lawler, “Optimal matroid intersections,” in:Combinatorial structures and their applications, Eds. R. Guy, H. Hanini, N. Sauer, J. Schonheim (Gordon and Braech, 1970) p. 233.

  23. A. Lehman, “On the width length inequality,” Mimeo. (1965).

  24. J.T. Robacker,Min-max theorems on shortest chains and disjunct cuts of a network (The Rand Corporation, RM-1660-PR, 1956).

  25. W.T. Tutte, “On the problem of decomposing a graph inton connected factors.”J. London Mathematical Society 36 (1961) 221.

    Google Scholar 

  26. W.T. Tutte, “Lectures on matroids,”J. Research National Bureau of Standards 69B (1965) 1.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Rand Corporation, Santa Monica, Calif., USA

    D. R. Fulkerson

  2. Cornell University, Ithaca, N.Y., USA

    D. R. Fulkerson

Authors
  1. D. R. Fulkerson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fulkerson, D.R. Blocking and anti-blocking pairs of polyhedra. Mathematical Programming 1, 168–194 (1971). https://doi.org/10.1007/BF01584085

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584085

Keywords

Search

Navigation