Multicommodity flows in tree-like networks

Abstract

A problem of finding multicommodity minimum-cost flows in tree-like networks is considered. To solve this problem, an algorithm based on the reduction to a problem of finding a single-commodity flow in a network of arbitrary structure is proposed. For single-commodity flows in tree-like networks, an algorithm using a procedure of border reduction is used.