KnowraMaximum flow problemLinked fromLinked fromThe 21 pages that link to Maximum flow problem, each with the reason it gives.All 21Broader topic 1Related 9Narrower topic 6Compared with 5Shortest path problemCompared with: It optimizes capacity-limited throughput rather than the weight of a single route.Assignment problemCompared with: Assignment fixes pairing structure and minimizes cost; maximum flow instead maximizes throughput.Transportation problemCompared with: It maximizes throughput, whereas the transportation problem meets fixed demands at minimum cost.Minimum-cost flow problemCompared with: It maximizes throughput, whereas minimum-cost flow minimizes expense for specified balances.Blossom algorithmCompared with: Bipartite matching reduces to flow, but general matching needs blossom machinery.