MIN-MAX ALGORITHM FOR THE PARAMETRIC FLOW PROBLEM
Mircea Parpalea · 2010
The algorithm presented in this paper solves the minimum flow problem in a parametric network with linear lower bound functions by computing a parametric maximum flow from the sink node to the source node. The algorithm does not work directly in the original parametric network but in the parametric residual network defined as for the parametric maximum flow problem. The complexity of the parametric minmax algorithm is equal to the complexity of the parametric maximum flow algorithm.