How to solve a max flow with min cost problem using or-tools?

[felipheggaliza]

Do someone know how I could use or-tools to solve a max flow with min cost problem?

I am trying to find something similar to the max_flow_min_cost from NetworkX.

I found this code in NetworkX repository, I am not sure yet but it seems it first solves the max flow first and later it solves the min cost problem.

Can someone give me an example of code snippet for solving max_flow_min_cost using or-tools?

[jmarca]

Maybe start with the excellent documentation? https://developers.google.com/optimization/flow/maxflow James

…

On Aug 31, 2022, at 14:34, Feliphe Gonçalves Galiza ***@***.***> wrote:  Do someone know how I could use or-tools to solve a max flow with min cost problem? I am trying to find something similar to the max_flow_min_cost from NetworkX. I found this code in NetworkX repository, I am not sure yet but it seems it first solves the max flow first and later it solves the min cost problem. Can someone give me an example of code snippet for solving max_flow_min_cost using or-tools? — Reply to this email directly, view it on GitHub, or unsubscribe. You are receiving this because you are subscribed to this thread.