A polynomial algorithm for minimum quadratic cost flow problems
Network flow problems with quaratic separable costs appear in a number of important applications such as approximating input-output matrices in economy, projecting and forecasting traffic matrices in telecommunication networks, or solving nondifferentiable cost flow problems by subgradient algorithms. Extending a scaling technique, used in the case of linear cost flows, to quadratic cost flows, a polynomial algorithm for this class of problems is given.
scientific article; zbMATH DE number 3885618
scientific article