Minimum-Cost Flow
Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, each edge is given a cost coefficient, and we wish to minimize total cost while reaching a threshold flow.
Parameters
- : number of vertices
- : number of edges
- : maximum edge capacity
- : minimum required flow
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table