minimum cost network flow problem 最小费用流问题
Minimum Cost Network Flow Model 最小费用流问题
minimum cost network flow 最小费用网络流
minimum cost network flow algorithm 最小费用网络流算法
A new minimum cost network flow algorithm is described for the image reconstruction from their two orthogonal 1-d projections.
本文提中一种最小费用流算法，实现从两个正交的一维投影重建图象。
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
And it also presents an example calculation of optimizing minimum cost time limit for fuzzy network to explain this new method.
给出了一个模糊网络最低成本日程优化的实例计算，通过实例计算说明了计算的新方法。
应用推荐