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.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
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.
对分配网络流做了介绍，通过将网络单纯形算法加以推广，得到了一类特殊分配网络流的最小费用流的一种算法。
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 RBF nerve network is one kind partial approaches network and the question has the only determination solution, moreover, the BP net often meets the partial minimum problem.
另外，R BF神经网络是一种局部逼近网络，问题有唯一确定的解，不存在BP网中所遇到的局部极小值问题。
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完全问题，传统方法难以求解，一般采用启发式方法求解。
The initial PID parameter value is determined by the relay auto-tuning method, so the part minimum problem of the neural network can be prevented.
用继电器自整定法确定PID参数的初值，防止神经网络的局部极小问题。
Based on the minimum output energy criterion, the algorithm is formulated as a constrained optimization problem inherently and is then resolved efficiently by using neural network.
这种盲检测算法基于最小平均输出能量准则，本质上是一个有约束的最优化问题。
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.
本论文着力针对全球区域经济间港口集装箱运输网络系统的最小费用流问题，研究运用现代优化方法来合理配置集装箱的跨洋运输。
Then using the approach to the transportation problem in the linear programming, a network configuration with optimal current-flow and minimum line-loss can be found out.
然后按线性规划中运输问题的解法，寻求最小线损网架的优化电流潮流，从而定出合理的线损最小网架。
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
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.
该算法对干涉相位图建立网络模型，将相位解缠的最小化问题转化为求网络最小费用问题，利用网络规划理论中成熟高效的算法求解。
应用推荐