# minimum flow

﻿
minimum flow
минимальный сток

Тимашев И.Е. Геоэкологический русско-английский словарь-справочник: Справочное издание. – М.: ИД «Муравей-Гайд», 1999. Охрана окружающей среды. Терминология: Справочное пособие. – М.: Издательство стандартов, 1991. 2011.

### Смотреть что такое "minimum flow" в других словарях:

• minimum flow-rate — mažiausias srautas statusas T sritis Standartizacija ir metrologija apibrėžtis Srauto vertė, atitinkanti apatinę srauto matavimo srities ribą. atitikmenys: angl. minimum flow rate vok. kleinster Durchfluss, m rus. минимальный поток, m pranc.… …   Penkiakalbis aiškinamasis metrologijos terminų žodynas

• minimum flow-rate — mažiausiasis srautas statusas T sritis fizika atitikmenys: angl. minimum flow rate vok. kleinster Durchfluß, m rus. минимальный поток, m pranc. débit minimal, m …   Fizikos terminų žodynas

• Minimum Information Standards — Minimum Information (MI) standards or reporting guidelines specify the minimum amount of meta data (information) and data required to meet a specific aim or aims. Usually the aim is to provide enough meta data and data to enable the unambiguous… …   Wikipedia

• Minimum viable population — (MVP) is a lower bound on the population of a species, such that it can survive in the wild. This term is used in the fields of biology, ecology, and conservation biology. More specifically MVP is the smallest possible size at which a biological… …   Wikipedia

• Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also …   Wikipedia

• Minimum cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Definition Given a flow network ,G(V,E) with source s in V and sink t in V, where edge (u,v) in E has capacity ,c(u,v) …   Wikipedia

• Minimum cut — In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible. Several algorithms exist to find minimum cuts. For a graph G = (V, E), the problem can be… …   Wikipedia

• Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… …   Wikipedia

• Minimum k-cut — In mathematics, the minimum k cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to k connected components. These edges are referred to as k cut. The goal is to find the… …   Wikipedia

• Minimum acceptable rate of return — In business and engineering, the minimum acceptable rate of return, often abbreviated MARR, or hurdle rate is the minimum rate of return on a project a manager or company is willing to accept before starting a project, given its risk and the… …   Wikipedia

• Minimum-Varianz-Portfolio — Dieser Artikel oder Abschnitt bedarf einer Überarbeitung. Näheres ist auf der Diskussionsseite angegeben. Hilf mit, ihn zu verbessern, und entferne anschließend diese Markierung. Die Portfoliotheorie ist ein Teilgebiet der Finanzierung und… …   Deutsch Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.