The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs
The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs
复制标题
固定源数和非线性弧成本的最小凹成本网络流问题
DOI：
10.1007/bf01096764
复制
发表时间：
1995
影响因子：
1.8
通讯作者：
P. Värbrand
中科院分区：
文献类型：
--
作者：
H. Tuy;Saied Ghannadan;A. Migdalas;P. Värbrand
我们证明了具有固定源数和非线性弧数的最小凹费用网络流问题可以通过一个算法来求解，该算法需要大量的初等运算和对非线性代价函数的多次求值，这些非线性代价函数都是由多项式INR，n，m所限定的，其中是网络中的节点数，n是弧数，m是网络中的汇数。
We prove that the Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs can be solved by an algorithm requiring a number of elementary operations and a number of evaluations of the nonlinear cost functions which are both bounded by polynomials inr, n, m, wherer is the number of nodes,n is the number of arcs andm the number of sinks in the network.