Multi-terminal maximum flows in node-capacitated networks (Q1085773)

The problem of finding the maximum flows between each pair of nodes in a subset of K nodes of a node- and arc-capacitated undirected network is considered. This problem arises in the study of communication and transportation networks. \textit{R. E. Gomory} and \textit{T. C. Hu} [SIAM J. Appl. Math. 9, 551-570 (1961; Zbl 0112.124)] solved the arc-capacited case for this problem. The purpose of this paper is to extend Gomory and Hu's result to the general node- and arc-capacited case.