Finding the Foremost Ares in a Network with Parametric Are Capacities
D. Ivanchev · Optimization · 1985
The problem considered in this paper deals with the finding of on ares in flow network with parametric are capacities whose removal would lead to a minimization of the maximal flow value. An algorithm is proposed here for the solution of this problem: an interval of linear variations of the parameter divided into sub-intervals, in each of which there are link constants. It is proved that the are capacity obtained here is a concave piece-wise linear function of the parameter. The submitted results represent generalized results obtained by Ratliff/Sicilia/Lurore.