摘要
本文提出一个关于最大流的弧扩张问题,它是一个费用为分段线性函数的最小费用流问题。我们将给出它的数学模型并藉助于图论技巧了得到一般解法。
Abstract This paper proposes an are extension problem of max—flow.It is a min-cost flowproblem in which the cost function is piecewise linear。The mathematical model is presented and analgorithm through some techniques of graph theory is obtained.
出处
《郑州大学学报（理学版）》
CAS
1993年第3期10-14,共5页
Journal of Zhengzhou University:Natural Science Edition
