D. R. Fulkerson

Minimal k-arc Connected Graphs

1971
Blocking and Anti-Blocking Pairs of Polyhedra.

1970
Disjoint Common Partial Transversals of Two Families of Sets.

1969
Blocking Polyhedra

1968
Bottleneck Extrema

1968
Networks, Frames, Blocking Systems.

1967
A Transportation Program for Filling Idle Classrooms in Los Angeles

1966
Transversal packings and covers

1965
Transversals and Matroid Partition

1965
Scheduling in Project Networks

1964
Upsets in Round Robin Tournaments.

1964
An algorithm for scaling matrices: notes on linear programming and extensions-part 58.

1962
Expected Critical Path Lengths in PERT Networks

1962
Flows in Networks

1962
Multiplicities and minimal widths for (0,1)-matrices.

1962
Widths and heights of (0,1)-matrices.

1962
Width sequences for special classes of (0,1)-matrices.

1962
An algorithm for scaling matrices.

1961
An Out-of-Kilter Method for Minimal Cost Flow Problems

1960
Comments on "Solution of the quota problem by a successive-reduction method.".

1958
Increasing the capacity of a network: the parametric budget problem.

1958
Notes on Linear Programming: Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications

1958
A suggested computation for maximal multi-commodity network flows.

1958
Construction of maximal dynamic flows in networks.

1957
Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows

1957
A Tactical Air Game

1957
Hitchcock Transportation Problem.

1956
Notes on Linear Programming: Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem

1956
Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm

1956
Notes on Linear Programming — Part XXXII: Solving the Transportation Problem

1956
Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

1955
On the Max Flow Min Cut Theorem of Networks.

1955
A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.

1955
Maximal Flow through a Network.

1954
Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule

1954
Notes on Linear Programming: Part XX Maximal Flow Through a Network

1954
Solution of a Large-Scale Traveling-Salesman Problem

1954
A Production-Line Assignment Problem

1953

Federally Funded Research Divisions

Social and Economic Policy Divisions

International

D. R. Fulkerson

Minimal k-arc Connected Graphs

Blocking and Anti-Blocking Pairs of Polyhedra.

Disjoint Common Partial Transversals of Two Families of Sets.

Blocking Polyhedra

Bottleneck Extrema

Networks, Frames, Blocking Systems.

A Transportation Program for Filling Idle Classrooms in Los Angeles

Transversal packings and covers

Transversals and Matroid Partition

Scheduling in Project Networks

Upsets in Round Robin Tournaments.

An algorithm for scaling matrices: notes on linear programming and extensions-part 58.

Expected Critical Path Lengths in PERT Networks

Flows in Networks

Multiplicities and minimal widths for (0,1)-matrices.

Widths and heights of (0,1)-matrices.

Width sequences for special classes of (0,1)-matrices.

An algorithm for scaling matrices.

An Out-of-Kilter Method for Minimal Cost Flow Problems

Comments on "Solution of the quota problem by a successive-reduction method.".

Increasing the capacity of a network: the parametric budget problem.

Notes on Linear Programming: Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications

A suggested computation for maximal multi-commodity network flows.

Construction of maximal dynamic flows in networks.

Notes on Linear Programming: Part XLI Constructing Maximal Dynamic Flows from Static Flows

A Tactical Air Game

Hitchcock Transportation Problem.

Notes on Linear Programming: Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem

Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm

Notes on Linear Programming — Part XXXII: Solving the Transportation Problem

Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

On the Max Flow Min Cut Theorem of Networks.

A simple algorithm for finding maximal network flows and an application to the Hitchcock problem.

Maximal Flow through a Network.

Notes on Linear Programming: Part XV Minimizing the Number of Carriers to Meet a Fixed Schedule

Notes on Linear Programming: Part XX Maximal Flow Through a Network

Solution of a Large-Scale Traveling-Salesman Problem

A Production-Line Assignment Problem