We're discussing about the Network flow problem with carrier.
我们正在商讨带运输工具的网络流问题。
The VRP and the network flow problem are all famous network optimization problems.
车辆路径问题和网络流问题都是非常著名的网络优化问题。
The circulation problem and the generalized circulation problem cover the whole field of the flow analysis about the generalized network flow problem.
环流问题和一般环流问题构成了一般网络流量分析问题。
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.
对分配网络流做了介绍，通过将网络单纯形算法加以推广，得到了一类特殊分配网络流的最小费用流的一种算法。
Ascertaining two core problem of the empty wagon distribution: quantity distribution and network matching flow, and so making certain two different studying ways.
通过对空车调配问题的特点分析，明确了空车数量调配和网络配流是空车调配的两个核心问题，并确定了两条不同的研究路线。
In the conditions of satisfying the flow constraint, ensuring the network having sufficient reliability is a very important problem.
在满足流量约束的条件下，保证网络有足够的可靠度，是一个很重要的问题。
Network calculus is primarily used to dispose the flow problem in networks, and it can be used for flow problem modeling and quantitative analysis of flow problem.
网络微积分主要用于对网络中流问题的考察，它所形成的体系可以用于对网络中的流问题进行建模和定量分析。
"On paths optimization in a network with restriction of finite transported material" is very special cost flow problem.
“有限需求量的网络路径优选”是一种比较特殊的费用流问题。
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.
然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
It also introduces software flow and use for problem judgement and sets a model on network reconstruction and computer flow.
文中还给出了故障分段判断以及网络快速重构的软件流程和使用方法。
By expanding the classic transport problem in actual regional transportation network, the network flow distribution mode model based on paths reliability is proposed.
通过对经典运输问题在实际规模网络中进行扩展，建立了基于路径可靠性的区域运输网络运量分布模型。
In traffic field, Neural Network has good advantage in the non-linear Neural Network, and it 's specially good at problem perfectly solving the traffic in the field of the forward flow forecasting.
神经网络可以很好的解决交通领域内的非线性问题，其中前向型神经网络特别适合对交通流的预测。
A new evolutionary algorithm for solving multi-objective hybrid flow shop scheduling problem(HFSP) which is an important topic in supply chain network optimization is presented.
针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。
The first and third steps are multi-commodity flow problem; while the second step is the network coding problem.
第一阶段和第三阶段面临的是多商品流问题，第二阶段是网络编码问题。
Discusses the problem about the water flow control of primary pipe network when consumers randomly regulate water flow.
探讨了当热水供暖系统用户侧流量随意调节后一次网流量的调控问题。
The prediction of network traffic flow is a problem of great significance in the research work of resource allocation and congestion control.
在高速网络资源分配与拥塞控制研究中，网络业务流量的预报是一个具有重要意义的课题。
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
To begin with, this paper analyzed and compared kinds of methods solving the network maximum flow problem.
本文首先对现有求解网络最大流的各种算法进行了分析和比较。
This paper describes the relation between the transportation problem and the network flow programming, and discusses the importance of developing a transportation network system.
本文叙述了运输问题与网络规划之间的关系以及开发运输网络系统的重要意义，并给出了运输问题的数学模型。
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.
然后按线性规划中运输问题的解法，寻求最小线损网架的优化电流潮流，从而定出合理的线损最小网架。
This paper discusses the smallest cost problem on the undirection network, which has the upper limit of rate of flow, and sets up its mathematics model, and gives its relevant algorithm.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
With the method, a Delay-tolerant Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms.
容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。
This paper is concerned with the optimum routing and flow assignment problem in packet-switch networks. The optimum objective function is the network-wide average time delay.
研究分组交换网的路由选择及流量分配问题，以网络的平均时延为优化目标函数。
The problem of capacity and flow assignment (CFA) in computer communication networks is an extremely complex network optimization problem.
报文的路由选择和各条链路的容量及流量分配(CFA)问题是计算机通信网络中性能优化的两个重要方面。
The problem of capacity and flow assignment (CFA) in computer communication networks is an extremely complex network optimization problem.
报文的路由选择和各条链路的容量及流量分配(CFA)问题是计算机通信网络中性能优化的两个重要方面。
应用推荐