网络流在清理三角债问题中的应用  

APPLICATIONS OF NETWORK FLOWS TO CANCELLATIONS OF TRIANGLAR DEBIS

作　　者：蔡茂诚[1] 

机构地区：[1]中国科学院系统科学研究所,北京100080

出　　处：《系统科学与数学》1997年第1期48-53,共6页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金

摘　　要：本文把清理三角债中两种优化数学模型问题，化成求解相应网络上最小费用流的问题，从而得到（强）多项式算法，并把另外的一种优化数学模型问题。化成线性规划问题.于是解答了文[3]中提出的清理三角债的三个基本问题．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].

关 键 词：网络流 三角债 三角式算法 最小费用流 

分 类 号：O157.5[理学—数学] O224[理学—基础数学]