maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can...

minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through a flow network...

science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink...

Commons has media related to Flow networks. Maximum Flow Problem Real graph instances Lemon C++ library with several maximum flow and minimum cost circulation...

Specific types of network flow problems include: The maximum flow problem, in which the goal is to maximize the total amount of flow out of the source terminals...

polynomial time using a reduction to the maximum flow problem. It may be used to model various application problems of choosing an optimal subset of tasks...

(alternatively, preflow–push algorithm) is an algorithm for computing maximum flows in a flow network. The name "push–relabel" comes from the two basic operations...

multi-commodity flow problem is a network flow problem with multiple commodities (flow demands) between different source and sink nodes. Given a flow network...

matching problem is closely related to the augmenting paths arising in maximum flow problems, paths along which one may increase the amount of flow between...

circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation...