A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.
提出了利用最小费用流原理求解时间-费用优化模型的方法。
In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.
本文讨论了一般情况下线性规划问题出现“多反而少”现象的一充分必要条件，以及最小费用流问题出现“多反而少”现象的充分必要条件。
This paper proposes the concept of adjustable loop and tries to make some rudimentary study of the multiple optimum-solution of minimum cost flow.
本文提出了可调圈的概念，并力图对最小费用流问题的多重最优解进行一些探讨。
应用推荐