Minimum flows in networks with paramatric lower bounds for sink arcs
Keywords:
network flow, networks algorithms, minimum flow problem, paramatric networksAbstract
In this paper, we study minimum flows in a network with parametric lower bounds for the sink arcs problem. In this problem, the lower bounds for sink arcs are a nonincreasing linear function of a parameter λ, and we wish to determine a minimum ow for q values 0 = λ 1, λ 2, …, λq of parameter λ. Assume, that 0 = λ 1 < λ 2 < … < λq and q ≤ n, where n is a number of nodes.
