## Preview

Unable to display preview. Download preview PDF.

### Publications of Professor D. R. Fulkerson

- 1.
*Minimizing the Number of Tankers to Meet a Fixed Schedule*, Naval Research Logistics Quarterly, Vol. 1, pp. 217–222, 1954 (with G. B. Dantzig).Google Scholar - 2.
*Solution of a Large-Scale Traveling Salesman Problem*, Operations Research, Vol. 2, pp. 393–410, 1954 (with G. B. Dantzig and S. Johnson).Google Scholar - 3.
*Computation of Maximal Flows in Networks*, Naval Research Logistics Quarterly, Vol. 2, pp. 277–284, 1955 (with G. B. Dantzig).Google Scholar - 4.
*Maximal Flow Through a Network*, Canadian Journal of Mathematics, Vol. 8, pp. 399–404, 1956 (with L. R. Ford, Jr.).Google Scholar - 5.
*Solving the Transportation Problem*, Management Science, Vol. 3, pp. 24–32, 1956 (with L. R. Ford, Jr.).Google Scholar - 6.
*A Primal-Dual Algorithm for Linear Programs*, Linear Inequalities and Related Systems, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, pp. 171–181, 1956 (with G. B. Dantzig and L. R. Ford, Jr.).Google Scholar - 7.
*On the Min-Cut Max-Flow Theorem for Networks*, Linear Inequalities and Related Systems, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, pp. 215–221, 1956 (with G. B. Dantzig).Google Scholar - 8.
*Note on Dilworth's Decomposition Theorem for Partially Ordered Sets*, Proceedings of the American Mathematical Society, Vol. 7, pp. 701–702, 1956.Google Scholar - 9.
*A Tactical Air Game*, Operations Research, Vol. 5, pp. 704–713, 1957 (with S. Johnson).Google Scholar - 10.
*A Simple Algorithm for Finding Network Flows and an Application to the Hitchcock Problem*, Canadian Journal of Mathematics, Vol. 9, pp. 210–218, 1957 (with L. R. Ford, Jr.).Google Scholar - 11.
*A Primal-Dual Algorithm for the Capacitated Hitchcock Problem*, Naval Research Logistics Quarterly, Vol. 4, pp. 47–54, 1957 (with L. R. Ford, Jr.).Google Scholar - 12.
*A Suggested Computation for Maximal Multi-Commodity Network Flows*, Management Science, Vol. 5, pp. 97–101, 1958 (with L. R. Ford, Jr.).Google Scholar - 13.
*Constructing Maximal Dynamic Flows from Static Flows*, Operations Research, Vol. 6, pp. 419–433, 1958 (with L. R. Ford, Jr.).Google Scholar - 14.
*Network Flow and Systems of Representations*, Canadian Journal of Mathematics, Vol. 10, pp. 78–85, 1958 (with L. R. Ford, Jr.).Google Scholar - 15.
*Comments on Solution of the Quota Problem by a Successive Reduction Method*, Operations Research, Vol. 6, pp. 874–875, 1958 (with D. Gale).Google Scholar - 16.
*A Network Flow Feasibility Theorem and Combinatorial Applications*, Canadian Journal of Mathematics, Vol. 11, pp. 440–451, 1959.Google Scholar - 17.
*On a Linear Programming Combinatorial Approach to the Traveling Salesman Problem*, Operations Research, Vol. 7, pp. 58–66, 1959 (with G. B. Dantzig and S. Johnson).Google Scholar - 18.
*Increasing the Capacity of a Network: The Parametric Budget Problem*, Management Science, Vol. 5, pp. 472–483, 1959.Google Scholar - 19.
*Zero-One Matrices with Zero-Trace*, Pacific Journal of Mathematics, Vol. 10, pp. 831–836, 1960.Google Scholar - 20.
*Traces, Term Ranks, Widths, and Heights*, IBM Journal, Vol. 4, pp. 455–459, 1960 (with H. J. Ryser).Google Scholar - 21.
*An Out-of-Kilter Method for Minimal Cost Flow Problems*, SIAM Journal on Applied Mathematics, Vol. 9, pp. 18–27 1961.Google Scholar - 22.
*A Network Flow Computation for Project Cost Curves*, Management Science, Vol. 7, pp. 167–178, 1961.Google Scholar - 23.
*Widths and Heights of (0, 1)-Matrices*, Canadian Journal of Mathematics, Vol. 13, pp. 239–255, 1961 (with H. J. Ryser).Google Scholar - 24.
*Expected Critical Path Lengths in PERT-Networks*, Operations Research, Vol. 10, pp. 808–817, 1962.Google Scholar - 25.
*An Algorithm for Scaling Matrices*, SIAM Review, Vol. 4, pp. 142–146, 1962 (with P. Wolfe).Google Scholar - 26.
*Multiplicities and Minimal Widths for (0, 1)-Matrices*, Canadian Journal of Mathematics, Vol. 14, pp. 498–508, 1962 (with H. J. Ryser).Google Scholar - 27.
*Flows in Networks*(book), Princeton University Press, Princeton, New Jersey, 1962 (with L. R. Ford, Jr.). This book was 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, Vol. 15, pp. 371–396, 1963 (with H. J. Ryser).Google Scholar - 29.
*Flows in Networks*, Recent Advances in Mathematical Programming, Edited by R. L. Graves and P. Wolfe, McGraw-Hill Book Company, New York, New York, pp. 319–332, 1963.Google Scholar - 30.
*The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones*, Canadian Journal of Mathematics, Vol. 16, pp. 729–735, 1964.Google Scholar - 31.
*Incidence Matrices with the Consecutive 1's Property*, Bulletin of the American Mathematical Society, Vol. 70, pp. 681–684, 1964 (with O. A. Gross).Google Scholar - 32.
*Some Properties of Graphs with Multiple Edges*, Canadian Journal of Mathematics, Vol. 17, pp. 166–177, 1965 (with A. J. Hoffman and M. H. McAndrew).Google Scholar - 33.
*Incidence Matrices and Interval Graphs*, Pacific Journal of Mathematics, Vol. 15, pp. 835–855, 1965 (with O. A. Gross).Google Scholar - 34.
*Upsets in Round Robin Tournaments*, Canadian Journal of Mathematics, Vol. 17, pp. 957–969, 1965.Google Scholar - 35.
*Transversals and Matroid Patition*, Journal of Research of the National Bureau of Standards, Vol. 69B, pp. 147–153, 1965 (with J. Edmonds).Google Scholar - 36.
*Flow Networks and Combinatorial Operations Research*, American Mathematical Monthly, Vol. 73, pp. 115–138, 1966.Google Scholar - 37.D. R. Fulkerson
*Scheduling in Project Networks*, Proceedings of the IBM Symposium on Combinatorial Mathematics, pp. 73–92, 1964.Google Scholar - 38.
*Edge-Colorings in Bipartite Graphs*, Combinatorial Mathematics and Its Applications, Edited by R. C. Bose and T. A. Dowling, University of North Carolina Press, Chapel Hill, North Carolina, pp. 561–578, 1969 (with J. Folkman).Google Scholar - 39.
*Networks, Frames, Blocking Systems*, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. E. Veinott, Jr., American Mathematical Society, Providence, Rhode Island, pp. 303–335, 1968.Google Scholar - 40.
*Flows in Infinite Graphs*, Journal of Combinatorial Theory, Vol. 8, pp. 30–45, 1970 (with J. Folkman).Google Scholar - 41.
*Bottleneck Extrema*, Journal of Combinatorial Theory, Vol. 8, pp. 299–306, 1970 (with J. Edmonds).Google Scholar - 42.
*Blocking Polyhedra*, Graph Theory and Its Applications, Edited by B. Harris, Academic Press, New York, New York, pp. 93–112, 1970.Google Scholar - 43.
*Disjoint Common Partial Transversals of Two Families of Sets*, Studies in Pure Mathematics, Edited by L. Mirsky, Academic Press, New York, New York, pp. 107–113, 1971.Google Scholar - 44.
*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.
*Anti-Blocking Polyhedra*, Journal of Combinatorial Theory, Vol. 12, pp. 50–71, 1972.Google Scholar - 46.
*Blocking and Anti-Blocking Pairs of Polyhedra*, Mathematical Programming, Vol. 1, pp. 168–194, 1971.Google Scholar - 47.
*Minimal k-Arc Connected Graphs*, Networks, Vol. 1, pp. 91–98, 1971 (with L. S. Shapley).Google Scholar - 48.
*On the Perfect Graph Theorem*, Mathematical Programming, Edited by T. C. Hu and S. M. Robinson, Academic Press, New York, New York, pp. 69–76, 1973.Google Scholar - 49.
*Packing Rooted Directed Cuts in a Weighted Directed Graph*, Mathematical Programming, Vol. 6, pp. 1–14, 1974.Google Scholar - 50.
*Blocking Pairs of Polyhedra Arising from Network Flows*, Journal of Combinatorial Theory, Vol. 18, pp. 265–283, 1975 (with D. B. Weinberger).Google Scholar - 51.
*On Balanced Matrices*, Mathematical Programming Study 1, Pivoting and Extensions, Edited by M. L. Balinski, North-Holland Publishing Company, Amsterdam, Holland, pp. 120–133, 1974 (with A. J. Hoffman and R. Oppenheim).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, Approaches to Integer Programming, Edited by M. L. Balinski, North-Holland Publishing Company, Amsterdam, Holland, pp. 72–82, 1975 (with G. L. Nemhauser and L. E. Trotter, Jr.).Google Scholar - 53.
*On Edge Disjoint Branching*, Networks, Vol. 6, pp. 97–104, 1976 (with G. Harding).Google Scholar - 54.
*Studies in Graph Theory*(edited book), Monographs in Applied Mathematics, Studies 11 and 12, Academic Press, New York, New York, 1976.Google Scholar

## Copyright information

© Plenum Publishing Corporation 1976