flow problem发音

意思翻译

潦题

相似词语短语

flow───vi.流; 垂; 流出; （谈话、文体等）流畅；n.流动；生产，供应；车流；流量；传播；流通；滔滔不绝；连贯，流畅；涨潮；泛滥；（苏格兰）湿地，沼泽；月经；vt.使泛滥; 淹没; 排出；n.流动; 滔滔不绝; 涨潮; 连贯；v.（使）流动，涌流；流通；传播；流畅；充满；大量供应；涨；涨潮；川流不息；飘扬；来自，由……产生；来月经；（矿物、岩石等）变形；n.(Flow)（美）弗洛（人名）

problem───n.难题；引起麻烦的人；adj.成问题的；难处理的

address problem───地址问题

housing problem───住房问题；房屋问题

connection problem───[经]衔接问题

statistics problem───统计问题

atomicity problem───原子性问题

counteracting problem───反问题

dual problem───[数]对偶问题；成对问题，对偶问题

双语使用场景

The VRP and the network flow problem are all famous network optimization problems.───车辆路径问题和网络流问题都是非常著名的网络优化问题。

It's basically a cash flow problem.───这基本上是一个资金流动的问题。

We're discussing about the Network flow problem with carrier.───我们正在商讨带运输工具的网络流问题。

Was it a cash flow problem, an example of overreaching , or were brand buyers turning their backs on Shanghai Tang's distinctive style?───是否是过度扩张导致的现金流问题，还是品牌消费者对上海唐氏的抛弃？

This could result in a serious cash flow problem for the supplier if goods continue to be produced but money is not collected.───这可能导致严重的现金流问题，为供应商的商品，如果继续生产，但钱是不能收。

This method basically consists in formulating the power flow problem as a set of autonomous ordinary differential equations.───这个办法根底上包括一系列的常微分方程用作公式化能量流问题。

The cut-off negative pressure method is one of effective approaches to solve the seepage flow problem with free surface.───截止负压法是求解有自由面渗流问题较为有效的算法之一。

Does not need cooling at the season, hot water unit circle groundwater, there is no minimum evaporator water flow problem.───在不需要供冷的季节，热水机组循环地下水，不存在蒸发器的最小水流量的问题。

By adding the parallel arcs, the network flow problem with the upper and lower bounds is transformed to the ordinary network flow problem.───通过增设平行边，将容量有上下界约束的网络流问题转化为一般网络流问题；

英语使用场景

In short they have a flow problem – a problem of effluence .

The author study the minimum cost flow problem with not only fixed cost but also variable cost, and they found it be a mixed 0-1 linear program, and it does not have polynomial time algorithm.

The minimum cut problem and maximum flow problem with both node and edge capacities in general networks can be easily reduced to the problem with only edge capacities.

The maximum flow problem is one of the classical combinatorial optimization problems.

The maximum flow problem is a focus of the studies about graph theory, operational research, optimization theory.

The maximum flow problem is a classical combinatorial optimization problem.

The company suffered from cash flow problem or staff problem.

It is a min - cost flow problem in which the cost function is piecewise linear.

Chapter nine considers the minimal cost network flow problem from the simplex method point of view.