D. R. Fulkerson, or Duncan Ray Fulkerson, was an influential American mathematician known primarily for his contributions to operations research and combinatorial optimization. He is perhaps best known for his work on network flows and combinatorial structures, including the development of the Edmonds-Karp algorithm for computing maximum flow in a network and for his contributions to the theory of linear programming. Fulkerson was active in the development of matroid theory and graph theory as well.
Articles by others on the same topic
Coauthor with George B. Dantzig and Selmer M. Johnson of the 1954 large-scale traveling salesman problem study. It demonstrates how optimization bounds and additional constraints can establish optimality for a concrete routing problem.[ref]
Solution of a Large-Scale Traveling-Salesman Problem by George B. Dantzig and others. author attribution and the named work’s subject