Other network flow problems: 3. Min-cost max-flow
Input description: a graph (network) G where each edge (v,w) has associated capacity c(v,w), and a cost cost(v,w).
Problem description: What is the maximum flow of minimum cost you can route from s to t while respecting the capacity constraint of each edge?
S f(v,w)ɬ cost (v,w)f(v,w)