Finding Most Vital Links over Time in a Flow Network
This paper deals with finding most vital links of a network which carries flows over time(also called ”dynamic flows”). Given a network and a time horizon T, Single Most Vital Link OverTime (SMVLOT) problem looks for a link whose removal results in greatest decrease in the value ofmaximum flow over...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Balikesir University
2012-07-01
|
| Series: | An International Journal of Optimization and Control: Theories & Applications |
| Subjects: | |
| Online Access: | http://ijocta.balikesir.edu.tr/index.php/files/article/view/98/48 |