Blocking and Anti-Blocking Pairs of Polyhedra. - 1970

Paper

Disjoint Common Partial Transversals of Two Families of Sets. - 1969

Research Memorandum

Blocking Polyhedra. - 1968

Research Memorandum

Bottleneck Extrema. - 1968

Research Memorandum

Networks, Frames, Blocking Systems. - 1967

Research Memorandum

A Transportation Program for Filling Idle Classrooms in Los Angeles - 1966

Paper

Transversal packings and covers - 1965

Research Memorandum

Transversals and Matroid Partition - 1965

Research Memorandum

Scheduling in Project Networks - 1964

Research Memorandum

Upsets in Round Robin Tournaments. - 1964

Research Memorandum

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

Research Memorandum

Expected Critical Path Lengths in PERT Networks - 1962

Research Memorandum

Flows in Networks - 1962

Report

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

Research Memorandum

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

Research Memorandum

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

Research Memorandum

An algorithm for scaling matrices. - 1961

Paper

Minimal k-arc-connected graphs. - 1961

Paper

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

Paper

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

Paper

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

Paper

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

Research Memorandum

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

Paper

Construction of maximal dynamic flows in networks. - 1957

Paper

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

Research Memorandum

A Tactical Air Game - 1957

Paper

Hitchcock Transportation Problem. - 1956

Paper

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

Research Memorandum

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

Research Memorandum

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

Research Memorandum

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

Research Memorandum

On the Max Flow Min Cut Theorem of Networks. - 1955

Paper

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

Paper

Maximal Flow through a Network. - 1954

Paper

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

Research Memorandum

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

Research Memorandum

Solution of a Large-Scale Traveling-Salesman Problem. - 1954

Paper