Instead of having an edge that requires a lower bound to flow through, is there a way to tweak the Ford-Fulkerson algorithm to solve a circulation and demand problem where a node must have a flow going outside towards other nodes? Note that this is also in addition to needing to consider the maximum capacity on each edge as well.

0

There are 0 best solutions below