We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
MAXIMUM FLOW OVER TIME PROBLEM IN PARAMETRIC NETWORKS.
- Authors
AVESALON GRIGORAŞ, Nicoleta
- Abstract
The article presents the maximum parametric flow problem in discrete dynamic networks with linear capacities and zero lower bounds. Based on an approach of partitioning the values range of the parameter, the algorithm proposed for solving the problem finds the maximum flow for a sequence of the parameter values, in their increasing order. The flow is repeatedly augmented along the shortest paths from source to sink in the time-space network, avoiding the explicit time expansion of the network. In each of its iterations, besides the maximum flow, the algorithm also computes a new value of the parameter up to which the computed flow remains a maximum one. Finally, the complexity of the algorithm is computed.
- Publication
Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics, 2014, Vol 7, Issue 56-1, p95
- ISSN
2065-2151
- Publication type
Academic Journal