Delbert Ray Fulkerson

According to our database, Delbert Ray Fulkerson authored at least 9 papers between 1954 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2010

Solution of a Large-Scale Traveling-Salesman Problem.

Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2004

A Suggested Computation for Maximal Multi-Commodity Network Flows.

Lester Randolph Ford Jr., Delbert Ray Fulkerson

Manag. Sci., 2004

1977

Maximizing the minimum source-sink path subject to a budget constraint.

Delbert Ray Fulkerson, Gary C. Harding

Math. Program., 1977

1976

On edge-disjoint branchings.

Delbert Ray Fulkerson, Gary C. Harding

Networks, 1976

1974

Packing rooted directed cuts in a weighted directed graph.

Delbert Ray Fulkerson

Math. Program., 1974

1971

Minimal k-arc connected graphs.

Delbert Ray Fulkerson, L. S. Shapley

Networks, 1971

Blocking and anti-blocking pairs of polyhedra.

Delbert Ray Fulkerson

Math. Program., 1971

1960

Traces, Term Ranks, Widths and Heights.

D. Ray Fulkerson, Herbert J. Ryser

IBM J. Res. Dev., 1960

1954

Solution of a Large-Scale Traveling-Salesman Problem.

George B. Dantzig, D. Ray Fulkerson, Selmer M. Johnson

Oper. Res., 1954