Quantifying the Interdependency Strength Across Critical Infrastructure Systems using a Dynamic Network Flow Redistribution Model

Author(s):  
Yu Wang ◽  
Jin-Zhu Yu ◽  
Hiba Baroud
Author(s):  
Adel Mottahedi ◽  
Farhang Sereshki ◽  
Mohamad Ataei ◽  
Ali Nouri Qarahasanlou ◽  
Abbas Barabadi

Author(s):  
Benjamin D. Trump ◽  
Kelsey Poinsatte-Jones ◽  
Meir Elran ◽  
Craig Allen ◽  
Bojan Srdjevic ◽  
...  

The theory of flows is one of the most important parts of Combinatorial Optimization and it has various applications. In this paper we study optimum (maximum or minimum) flows in directed bipartite dynamic network and is an extension of article [9]. In practical situations, it is easy to see many time-varying optimum problems. In these instances, to account properly for the evolution of the underlying system overtime, we need to use dynamic network flow models. When the time is considered as a variable discrete values, these problems can be solved by constructing an equivalent, static time expanded network. This is a static approach.


Sign in / Sign up

Export Citation Format

Share Document