Skip to main content
SpringerLink
Log in
Book cover

Polyhedral Combinatorics pp 141–158Cite as

Symmetric blocking and anti-blocking relations for generalized circulations

  • Chapter
  • First Online:

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 8))

Abstract

Blocking and anti-blocking results of a symmetric form are derived for certain families of points related to complementary orthogonal subspaces of R n. The relation of this material to earlier blocking and anti-blocking results for integral feasible flows in supply-demand and circulation networks and its relation to earlier blocking results for complementary orthogonal subspaces of R n are discussed. Combinatorial applications of these results arising when the subspaces under consideration are regular are described.

Research partially supported by Grant ENG 76-09936 from the National Science Foundation to Cornell University and by Sonderforschungsbereich 21 (DGF), Institut für Operations Research, Universität Bonn.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.G. Bland, private communication (1973).

    Google Scholar 

  2. R.G. Bland, “Complementary orthogonal subspaces of R n and orientability of matroids”, Ph.D. Thesis, Cornell University, School of Operations Research and Industrial Engineering, Tech. Rept. No. 219 (1974).

    Google Scholar 

  3. R.G. Bland, “Elementary vectors and two polyhedral relaxations”, European Institute for Advanced Studies in Management, Brussels, Belgium, Working Paper No. 76-60 (1976).

    Google Scholar 

  4. P. Camion, “Modules unimodulaires”, Journal of Combinatorial Theory 4 (1968) 301–362.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. D.R. Fulkerson, “Networks, frames, blocking systems”, in: G.B. Dantzig and A.F. Veinott, Jr., eds., Mathematics of the decision sciences. Lectures in applied mathematics, Vol. 11 (Am. Math. Soc., Providence, RI, 1968) pp. 303–335.

    Google Scholar 

  7. D.R. Fulkerson, “Blocking polyhedra”, in: B. Harris, ed., Graph theory and its applications (Academic Press, New York, 1970) pp. 93–111.

    Google Scholar 

  8. D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”, Mathematical Programming 1 (1971) 168–194.

    Article  MATH  MathSciNet  Google Scholar 

  9. D.R. Fulkerson, “Anti-blocking polyhedra”, Journal of Combinatorial Theory 12 (1972) 50–71.

    Article  MATH  MathSciNet  Google Scholar 

  10. D.R. Fulkerson and D.B. Weinberger, “Blocking pairs of polyhedra arising from network flows”, Journal of Combinatorial Theory 18 (1975) 265–283.

    Article  MATH  MathSciNet  Google Scholar 

  11. F.R. Giles, private communication (1977).

    Google Scholar 

  12. H.-C. Huang, “Investigations on combinatorial optimization”, Ph.D. Thesis, School of Organization and Management, Yale University (Cornell University, School of Operations Research and Industrial Engineering, Tech. Rept. No. 308 (1976)).

    Google Scholar 

  13. H.-C. Huang and L.E. Trotter, Jr., “A technique for determining blocking and anti-blocking polyhedral descriptions”, Institute for Econometrics and Operations Research, Bonn University, West Germany, Working Paper No. 7763-OR (1977).

    Google Scholar 

  14. C.J.H. McDiarmid, “Rado’s theorem for polymatroids”, Mathematical Proceedings of the Cambridge Philosophical Society 78 (1975) 263–281.

    Article  MATH  MathSciNet  Google Scholar 

  15. C.J.H. McDiarmid, “Blocking, anti-blocking, and pairs of matroids and polymatroids”, Cornell University. School of Operations Research and Industrial Engineering, Tech. Rept. No. 282 (1976).

    Google Scholar 

  16. 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.

    MATH  MathSciNet  Google Scholar 

  17. G.J. Minty, “A ‘from scratch’ proof of a theorem of Rockafellar and Fulkerson”, Mathematical Programming 7 (1974) 368–375.

    Article  MATH  MathSciNet  Google Scholar 

  18. R.T. Rockafellar, “The elementary vectors of a subspace of R n”, in: R.C. Bose and T.A. Dowling, eds., Combinatorial mathematics and its applications, proceedings of the North Carolina conference, Chapel Hill, April 10–14, 1967 (University of North Carolina, 1969) pp. 104–127.

    Google Scholar 

  19. M.J. Todd, “Dual families of linear programs”. Cornell University, School of Operations Research and Industrial Engineering, Tech. Rept. No. 197 (1973).

    Google Scholar 

  20. D.B. Weinberger, “Investigations in the theory of blocking pairs of polyhedra”. Ph.D. Thesis, Cornell University, School of Operations Research and Industrial Engineering, Tech. Rept. No. 190 (1973).

    Google Scholar 

  21. D.B. Weinberger, “Network flows, minimum coverings, and the four-color conjecture”, Operations Research 24 (1976) 272–290.

    Article  MATH  MathSciNet  Google Scholar 

  22. D.R. Woodall, “The induction of matroids by graphs”, Journal of the London Mathematical Society 10 (1975) 27–35.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, Ithaca, NY, USA

    L. E. Trotter

  2. Institut fur ökonometrie und Operations Research, Bonn University, Bonn, West Germany

    L. E. Trotter

  3. Goldman, Sachs and Company, New York, NY, USA

    D. B. Weinberger

Authors
  1. L. E. Trotter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. B. Weinberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. L. Balinski A. J. Hoffman

Rights and permissions

Reprints and permissions

Copyright information

© 1978 The Mathematical Programming Society

About this chapter

Cite this chapter

Trotter, L.E., Weinberger, D.B. (1978). Symmetric blocking and anti-blocking relations for generalized circulations. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121199

Download citation

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

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00789-7

  • Online ISBN: 978-3-642-00790-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation