Común · Historia
Maximum flow problem
Computational problem in graph theory
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Chin Ho Lee (Public domain) ·
Cartas cercanas
-
M★
Max-flow min-cut theorem
Theorem in optimization theory
-
M★
Minimum-cost flow problem
Mathematical optimization problem
-
★
Maximum cut
A cut of a graph whose size is at least the size of any other cut
-
★
Problema del clique
-
★★
Maximum subarray problem
The task of finding a contiguous subarray with the largest sum in a given array of numbers
-
U★
Utility maximization problem
The fundamental optimization problem that economic agents face