Aminimum-cost flow minimizes a linear edge cost subject to vertexflowbalances and edge capacity intervals. Subtracting every lower capacity from its edge flow converts all lower bounds to zero while shifting the balancevector and objective by constants.
