Letter to the Editor—Common Terminal Multicommodity Flow

An algorithm is presented to determine a multicommodity flow pattern which maximizes the objective function ∑ ⁱ⁼ⁿ_i=1 α_if_i for graphs having n sources and a common terminal, where f_i is the amount of flow of the ith commodity and α_i is a given set of nonnegative constants.