Skip to main content
SpringerLink
Log in

Delbert Ray Fulkerson

August 14, 1924–January 10, 1976

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

Publications of D.R. Fulkerson

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

    Article  Google Scholar 

  2. -“Solution of a large-scale traveling salesman problem”, Operations Research 2 (1954) 393–410 (with G. B. Dantzig and S. Johnsson).

    Article  MathSciNet  Google Scholar 

  3. -“Computation of maximal flows in networks”, Naval Research Logistics Quarterly 2 (1955) 277–284 (with G. B. Dantzig).

    Article  MathSciNet  Google Scholar 

  4. -“Maximal flow through a network”, Canadian Journal of Mathematics 8 (1956) 399–404 (with L. R. Ford, Jr.).

    MATH  MathSciNet  Google Scholar 

  5. -“Solving the transportation problem”, Management Science 3 (1956) 24–32 (with L. R. Ford, Jr.).

    Article  Google Scholar 

  6. -“A primal-dual algorithm for linear programs”, Annals of Mathematics Study 38 (1956) 171–181 (with G.B. Dantzig and L.R. Ford, Jr.).

    MathSciNet  Google Scholar 

  7. -“On the min-cut max-flow theorem for networks”, Annals of Mathematics Study 38 (1956) 215–221 (with G. B. Dantzig).

    MATH  MathSciNet  Google Scholar 

  8. -“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 

  9. -“A tactical air game”, Operations Research 5 (1957) 704–713 (with S. Johnson).

    Article  MathSciNet  Google Scholar 

  10. -“A simple algorithm for finding maximal network flows and an application to the Hitchcock problem”, Canadian Journal of Mathematics 9 (1957) 210–218 (with L. R. Ford, Jr.).

    MATH  MathSciNet  Google Scholar 

  11. -“A primal-dual algorithm for the capacitated Hitchcock problem”, Naval Research Logistics Quarterly 4 (1957) 47–54 (with L. R. Ford, Jr.).

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. -“Constructing maximal dynamic flows from static flows”, Operations Research 6 (1958) 419–433 (with L. R. Ford, Jr.).

    Article  MathSciNet  Google Scholar 

  14. -“Network flow and systems of representatives”, Canadian Journal of Mathematics 10 (1958) 78–85 (with L. R. Ford, Jr.).

    MATH  MathSciNet  Google Scholar 

  15. -“Comments on solution of the quota problem by a successive reduction method”, Operations Research 6 (1958) 874–875 (with D. Gale).

    Article  MathSciNet  Google Scholar 

  16. -“A network flow feasibility theorem and combinatorial applications”, Canadian Journal of Mathematics 11 (1959) 440–451.

    MATH  MathSciNet  Google Scholar 

  17. -“On a linear programming combinatorials approach to the traveling salesman problem”, Operations Research 7 (1959) 58–66 (with G. B. Dantzig and S. Johnson).

    Article  MathSciNet  Google Scholar 

  18. -“Increasing the capacity of a network: the parametric budget problem”, Management Science 5 (1959) 472–483.

    Article  MATH  MathSciNet  Google Scholar 

  19. -“Zero-one matrices with zero trace”, Pacific Journal of Mathematics 10 (1960) 831–836.

    MATH  MathSciNet  Google Scholar 

  20. -“Traces, term ranks, widths and heights”, I. B. M. Journal 4 (1960) 455–459 (with H. J. Ryser).

    MATH  MathSciNet  Google Scholar 

  21. -“An out-of-kilter method for minimal cost flow problem”, Journal of the Society for Industrial and Applied Mathematics 9 (1961) 18–27.

    Article  MATH  Google Scholar 

  22. -“A network flow computation for project cost curves”, Management Science 7 (1961) 167–178.

    Article  MATH  MathSciNet  Google Scholar 

  23. -“Widths and heights of (0,1)-matrices”, Canadian Journal of Mathematics 13 (1961) 239–255 (with H. J. Ryser).

    MATH  MathSciNet  Google Scholar 

  24. -“Expected critical path lengths in PERT-networks”, Operations Research 10 (1962) 808–817.

    Article  MATH  Google Scholar 

  25. -“An algorithm for scaling matrices”, SIAM Review 4 (1962) 142–146 (with P. Wolfe).

    Article  MathSciNet  Google Scholar 

  26. -“Multiplicities and minimal widths for (0,1)-matrices”, Canadian Journal of Mathematics 14 (1962) 498–508 (with H. J. Ryser).

    MATH  MathSciNet  Google Scholar 

  27. D. R. Fulkerson Flows in networks (Princeton University Press and Oxford University Press, 1962) 194pp (with L.R. Ford, Jr.). [Also published in French, Russian, Polish and Japanese editions.]

    Google Scholar 

  28. -“Width sequences for special classes of (0,1)-matrices”, Canadian Journal of Mathematics 15 (1963) 371–396 (with H.J. Ryser).

    MATH  MathSciNet  Google Scholar 

  29. D. R. Fulkerson “Flows in networks”, Recent advances in mathematical programming, McGraw Hill (1963) 319–332.

    Google Scholar 

  30. -“The maximum number of disjoint permutations contained in a matrix of zeros and ones”, Canadian Journal of Mathematics 16 (1964) 729–735.

    MathSciNet  Google Scholar 

  31. -“Incidence matrices with the consecutive 1’s property”, Bulletin of the American Mathematical Society 70 (1964) 681–684 (with O.A. Gross).

    Article  MATH  MathSciNet  Google Scholar 

  32. D. R. Fulkerson “Scheduling in project networks”, Proceedings of the I.B.M. Symposium on Combinatorial Mathematics (1964) 73–92.

    Google Scholar 

  33. -“Some properties of graphs with multiple edges”, Canadian Journal of Mathematics 17 (1965) 166–167 (with A.J. Hoffman and M.H. McAndrew).

    MATH  MathSciNet  Google Scholar 

  34. -“Incidence matrices and interval graphs”, Pacific Journal of Mathematics, 15 (1965) 835–855 (with O.A. Gross).

    MATH  MathSciNet  Google Scholar 

  35. -“Upsets in round robin tournaments”, Canadian Journal of Mathematics, 17 (1965) 957–969.

    MATH  MathSciNet  Google Scholar 

  36. -“Transversals and matroid partition”, Journal of Research of the National Bureau of Standards 69B (1965) 147–153 (with Jack Edmonds).

    MathSciNet  Google Scholar 

  37. -“Flow networks and combinatorial operations research”, American Mathematical Monthly 73 (1966) 115–138. (Also in reference 53, 139–171.).

    Article  MATH  MathSciNet  Google Scholar 

  38. D. R. Fulkerson “Networks, frames, blocking systems”, Mathematics of the Decision Sciences American Mathematical Society (1968) 303–335.

    Google Scholar 

  39. D. R. Fulkerson “Edge-colorings in bipartite graphs”, Combinatorial Mathematics and its Applications, University of North Carolina Press (1969) 561–578 (with Jon Folkman).

    Google Scholar 

  40. -“Flows in infinite graphs”, Journal of Combinatorial Theory 8 (1970) 30–45 (with Jon Folkman).

    Article  MATH  MathSciNet  Google Scholar 

  41. -“Bottleneck extrema”, Journal of Combinatorial Theory 8 (1970) 299–306 (with Jack Edmonds).

    Article  MATH  MathSciNet  Google Scholar 

  42. D. R. Fulkerson “Blocking polyhedra”, Graph theory and its applications, Academic Press (1970) 93–111.

    Google Scholar 

  43. D. R. Fulkerson “Disjoint common partial transversals of two families of sets”, Studies in pure mathematics, Academic Press (1971) 107–113.

    Google Scholar 

  44. D. R. Fulkerson “The perfect graph conjecture and pluperfect graph theorem”, Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications (1971).

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  46. -“Minimal k-arc connected graphs”, Networks 1 (1971) 91–98 (with L.S. Shapley).

    Article  MATH  MathSciNet  Google Scholar 

  47. -“Anti-blocking polyhedra”, Journal of Combinatorial Theory 12 (1972) 50–71.

    Article  MATH  MathSciNet  Google Scholar 

  48. D. R. Fulkerson “On the perfect graph theorem”, Mathematical programming, ed. by T.C. Hu and S.M. Robinson, publication No. 30 of the Mathematics Research Center, University of Wisconsin, Academic Press (1973) 69–77.

    Google Scholar 

  49. -“Packing rooted directed cuts in a weighted directed graph”, Mathematical Programming 6 (1974) 1–14.

    Article  MATH  MathSciNet  Google Scholar 

  50. -“On balanced matrices”, Mathematical Programming Study 1 (1974) 120–133 (with A.J. Hoffman and Rosa Oppenheim).

    MathSciNet  Google Scholar 

  51. -“Blocking pairs of polyhedra arising from network flows”, Journal of Combinatorial Theory 18 (1975) 265–283 (with D.B. Weinberger).

    Article  MATH  MathSciNet  Google Scholar 

  52. -“Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems”, Mathematical Programming Study 2 (1975) 72–82 (with G.L. Nemhauser and L.E. Trotter, Jr.).

    Google Scholar 

  53. D. R. Fulkerson Editor of MAA studies in mathematics, Vols. 11 and 12, Studies in graph theory, Parts 1 and 2 (Math. Assoc. Am., 1975) 413 pp.

    Google Scholar 

  54. -“On edge disjoint branchings”, Networks 6 (1976) 97–104 (with Gary Harding).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, Ithaca, New York, U S A

    Louis J. Billera & William F. Lucas

Authors
  1. Louis J. Billera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William F. Lucas
    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

Billera, L.J., Lucas, W.F. (1978). Delbert Ray Fulkerson. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121190

Download citation

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

  • 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