This means if we use any Max Flow algorithm that terminates with no augmenting paths (such as the Ford-Fulkerson Algorithm [1]} adapted to work with vb-flows and vb-capacities) we have found a maximum flow in a vb-network.
