I am struggling to find an example with a solution for a Minimum Cost Capacitated Flow problem. My network is defined as a graph G = (V, E), where each edge has a capacity c(u, v) > 0, a flow f(u, v) >= 0, and a cost a(u, v). The solution must show a minimum cost using the maximum capacity of the network edges. The wikipedia (https://en.wikipedia.org/wiki/Minimum-cost_flow_problem) does not have any example. Do you know where I can find an example of this.

Thanks, Felipe

  • $\begingroup$ I think youtube.com/watch?v=IAJBm-AogQE works through an example. $\endgroup$ – Gerry Myerson Jul 18 '18 at 9:46
  • 1
    $\begingroup$ it is a good example, but it considers only cost unfortunately with no capacity for the edges still. $\endgroup$ – Felipe Jul 18 '18 at 10:39

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.