Letter to the Editor—Common Terminal Multicommodity Flow

Abstract

An algorithm is presented to determine a multicommodity flow pattern which maximizes the objective function ∑ i = n i =1 α i f i for graphs having n sources and a common terminal, where f i is the amount of flow of the i th commodity and α i is a given set of nonnegative constants.