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.
给出了一个模糊网络最低成本日程优化的实例计算，通过实例计算说明了计算的新方法。
It can let user divide with minimum security dangerous managing cost manage the network, safeguard the online security.
可以让用户以最小的安全分险和管理代价来管理网络，维护网络安全。
We described the distribution network flow and get an algorithm of minimum cost flow about a special distribution network flow problem by extending the network simplex method.
对分配网络流做了介绍，通过将网络单纯形算法加以推广，得到了一类特殊分配网络流的最小费用流的一种算法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.
本文主要讨论了生产网络流的最小费用问题，在研究该问题的基本结构及其对偶性质的基础上给出了该问题的网络单纯形法。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
According to the characteristic of network project, the concept of the Minimum Cut is introduced into the algorithm of the Least Cost Scheduling in network project so as to improve the approach.
根据网络计划的特点，在求解其最低费用日程时，引入最小割的概念，从而改进了该问题的求解方法。
This paper, focusing on the problem of the minimum cost in the regional containers transport network, does research on modern optimal method to deploy the overseas container transportation reasonably.
本论文着力针对全球区域经济间港口集装箱运输网络系统的最小费用流问题，研究运用现代优化方法来合理配置集装箱的跨洋运输。
Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
This paper discusses an optimization method to determine the minimum cost scheduling in network schedule by means of fuzzy linear programming.
本文提出用模糊线性规划求解网络计划最低费用日程的优化方法。
This method changes the phase unwrapping problem into a kind of searching the minimum cost of a network which has mature and efficient methods in network theory.
该算法对干涉相位图建立网络模型，将相位解缠的最小化问题转化为求网络最小费用问题，利用网络规划理论中成熟高效的算法求解。
This method changes the phase unwrapping problem into a kind of searching the minimum cost of a network which has mature and efficient methods in network theory.
该算法对干涉相位图建立网络模型，将相位解缠的最小化问题转化为求网络最小费用问题，利用网络规划理论中成熟高效的算法求解。
应用推荐