Maximum-Flow Task
(Redirected from Maximum flow problem)
Jump to navigation
Jump to search
A Maximum-Flow Task is an mathematical optimization task that requires finding a feasible flow through a single-source, single-sink flow network that is maximum.
- AKA: Maximum Flow Problem.
- See: Max-Flow Min-Cut Theorem, Optimization (Mathematics), Flow Network, Circulation Problem, Graph Direction, Cut (Graph Theory), Edmonds-Karp Algorithm.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Maximum_flow_problem Retrieved:2017-6-21.
- In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.
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.
- In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.