Skip to main content
SpringerLink
Log in

D.R. Fulkerson’s contributions to polyhedral combinatorics

  • Chapter
  • First Online:
Polyhedral Combinatorics

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Edmonds and D.R. Fulkerson, “Bottleneck extrema”, Journal of Combinatorial Theory 8 (1970) 299–306.

    Article  MATH  MathSciNet  Google Scholar 

  2. L.R. Ford, Jr. and D.R. Fulkerson, “Maximal flow through a network”, Canadian Journal of Mathematics 8 (1956) 399–404.

    MATH  MathSciNet  Google Scholar 

  3. L.R. Ford, Jr. and D.R. Fulkerson, “A suggested computation for maximal multi-commodity network flows”, Management Science 5 (1958) 97–101.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  5. D.R. Fulkerson, “Note on Dilworth’s decomposition theorem for partially ordered sets”, Proceedings of the American Mathematical Society 7 (1956) 701–702.

    Article  MATH  MathSciNet  Google Scholar 

  6. D.R. Fulkerson, “Networks, frames, blocking systems”, Mathematics of the decision sciences (Am. Math. Soc., Providence, RI, 1968) pp. 303–335.

    MATH  Google Scholar 

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

    Google Scholar 

  8. D.R. Fulkerson, “The perfect graph conjecture and pluperfect graph theorem”, in: Proceedings of the second Chapel Hill conference on combinatorial mathematics and its applications (1971).

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. D.R. Fulkerson, “On the perfect graph theorem”, in: T.C. Hu and S.M. Robinson, eds., Mathematical programming (Academic Press, New York, 1973) pp. 69–77.

    Google Scholar 

  11. D.R. Fulkerson and G.B. Dantzig, “Minimizing the number of tankers to meet a fixed schedule”, Naval Research Logistics Quarterly 1 (1954) 217–222.

    Article  Google Scholar 

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

  13. D.R. Fulkerson, G.B. Dantzig and S. Johnson, “Solution of a large-scale traveling salesman problem”, Operations Research 2 (1954) 393–410.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.B.M., Yorktown Heights, NY, USA

    A. J. Hoffman

Authors
  1. A. J. Hoffman
    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

Hoffman, A.J. (1978). D.R. Fulkerson’s contributions to polyhedral combinatorics. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121191

Download citation

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

  • 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