A Suggested Computation for Maximal Multi-Commodity Network Flows

By L. R. Ford, D. R. Fulkerson. Management Sciences, 2004

363 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, background): “Other important contributions are due to Farkas [26] and Minkowski [39].”
Selected Topics in Column Generation (2002, background): “Almost ﬁve decades have passed since Ford and Fulkerson (1958) suggested dealing only implicitly with the variables of a multicommodity ﬂow problem.”
Bin packing and cutting stock problems: Mathematical models and exact algorithms (2016, background): “In 1961 Gilmore and Gomory [69] introduced, for this class of problems, the concept of column generation, by deriving it from earlier ideas of Ford and Fulkerson [63] and Dantzig and Wolfe [40].”
Routing, flow, and capacity design in communication and computer networks (2004, background): “In turn, Ford and Fulkerson [FF58] were perhaps the first to formulate the maximal flow multi-commodity problem using link-path representation.”
IReEn: Iterative Reverse-Engineering of Black-Box Functions via Neural Program Synthesis (2020, background): “Similar problems have been encountered in constraint optimization, where column generation algorithms / delayed constraint generation techniques have been employed to deal with large number of constraints (Ford Jr and Fulkerson, 1958).”