minimum cost flow的意思

minimum cost flow中文翻譯：

最小成本流

相似詞語短語

minimum───adj.最小的；最低的；n.最小值；最低限度；最小化；最小量

flow───vi.流; 垂; 流出; （談話、文體等）流暢；n.流動；生產，供應；車流；流量；傳播；流通；滔滔不絕；連貫，流暢；漲潮；泛濫；（蘇格蘭）濕地，沼澤；月經；vt.使泛濫; 淹沒; 排出；n.流動; 滔滔不絕; 漲潮; 連貫；v.（使）流動，涌流；流通；傳播；流暢；充滿；大量供應；漲；漲潮；川流不息；飄揚；來自，由……產生；來月經；（礦物、巖石等）變形；n.(Flow)（美）弗洛（人名）

minimum order───最低訂購量

minimum balance───[經] 最低余額；最低余額；最小庫存余量

minimum value───[數]極小值，[數]最小值；最小值，極小值

minimum line───最小線

minimum standard───最低標準

minimum wage───最低工資

minimum price───最低價; 底價；[物價]最低價格

雙語使用場景

method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.───提出了利用最小費用流原理求解時間-費用優化模型的方法。

In this paper, the minimum cost flow problem with fuzzy constraint is proposed for the first time, and the corresponding mathematical model is constructed.───本文首次提出了帶模糊約束的最小費用流問題，建立了相應的數學模型并給出了求解這一模型的有關算法。

In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.───本文討論了一般情況下線性規劃問題出現“多反而少”現象的一充分必要條件，以及最小費用流問題出現“多反而少”現象的充分必要條件。

Using Minimum Cost Flow Model to Optimize Evacuation Routes Considering Delays and Capacity at Intersections───考慮交叉口延誤和通行能力優化疏散救援路線的最小費用流模型

The Minimum Cost Flow Algorithm of Highway Earthwork Allocation in Modeling with Spreadsheets───基于電子表格建模的公路土石方調配最小費用流算法

Improvement and Application of the Minimum Cost Flow Algorithm───最小費用路算法的改進及其應用

Application of Minimum-Cost Flow Algorithm for Routing and Timeslot Selection in SDH Network───最小費用流算法在SDH路由時隙配置中的應用

Study on Capacitated Minimum Cost Flow Problem with Genetic Algorithm───遺傳算法求解帶容量限制的最小費用流問題

Research on Solving Various Commodity Minimum Cost Flow Problem───一種多品種最小費用流求解方法的研究

英語使用場景

A new phase unwrapping algorithm based phase second difference and minimum cost flow algorithm is presented.

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.

This paper proposes the concept of adjustable loop and tries to make some rudimentary study of the multiple optimum-solution of minimum cost flow.

A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle.

In this paper we discuss the sufficient and necessary conditions for existence of the more-for-less paradox in a minimum cost flow problem.

In this paper, the minimum cost flow problem with fuzzy constraint is proposed for the first time, and the corresponding mathematical model is constructed.

In this paper, a recirculation algorithm for minimum cost flow in a network is discussed.

We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.

An improved minimum cost flow algorithm is designed for the model and a numerical network example is given at last.