flow problem的意思

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.