Algorithm for Max Network Flow with lower bounds and its complexity
http://jeffe.cs.illinois.edu/teaching/algorithms/notes/25-maxflowext.pdf

There's a very simple reduction from that problem to the maximum flow problem. This is simply called "maximum flow with edge demands".