Hi all,

I am currently stuck on a problem that can be solved by finding the minimum cost of the maximum flow in a graph with lower and upper bounds on edge capacities.

My problem combines aspects of minimum-cost flow and maximum flow with node demands. I have also come across the "Minimum Cost b-Flow" problem, which is similar, but it does not maximize the total flow.

Does anyone have any ideas for solving this problem? Thanks in advance.