KnowraMinimum-cost flow problemLinked fromLinked fromThe 8 pages that link to Minimum-cost flow problem, each with the reason it gives.All 8Related 5Narrower topic 1Compared with 2Assignment problemRelated: A network-flow formulation solves assignment instances and generalizes them to capacities and supplies.Maximum flow problemCompared with: It minimizes routing cost for a specified demand instead of maximizing flow value.Flow conservationRelated: Its demands and supplies determine the balance required at each vertex.Transportation problemNarrower topic: The transportation problem is a complete bipartite special case of minimum-cost flow.Flow networkCompared with: Unlike plain maximum flow, it optimizes cost as well as feasibility.Circulation problemRelated: Adding edge costs turns feasible circulation into a routing optimization problem.Bellman–Ford algorithmRelated: Shortest augmenting-path methods may use Bellman–Ford when residual edges have negative costs.Hungarian algorithmRelated: It generalizes assignment to broader network structures and capacities.