APPLICATIONS OF NETWORK FLOWS TO CANCELLATIONS OF TRIANGLAR DEBIS
网络流在清理三角债问题中的应用

In this paper, we study three mathematical models of optimal cancellations of triangular debts. It is shown that the first two models can be transformed into minimum cost flow problems, hence can be solved by strong polynomial algorithms, and the third can be formulated as a linear programming. Consequently we solve completely three basic problems of optimal cancellations of triangular debts posed in 3].