scholarly journals Efficient continuous-time dynamic network flow algorithms

1998 ◽  
Vol 23 (3-5) ◽  
pp. 71-80 ◽  
Author(s):  
L. Fleischer ◽  
É. Tardos

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.


2014 ◽  
Vol 13 (2s) ◽  
pp. 1-21 ◽  
Author(s):  
Xiaohang Wang ◽  
Mei Yang ◽  
Yingtao Jiang ◽  
Peng Liu ◽  
Masoud Daneshtalab ◽  
...  

2018 ◽  
Vol 113 (522) ◽  
pp. 519-533 ◽  
Author(s):  
Xi Chen ◽  
Kaoru Irie ◽  
David Banks ◽  
Robert Haslinger ◽  
Jewell Thomas ◽  
...  

2011 ◽  
Vol 53 (3) ◽  
pp. 497-524 ◽  
Author(s):  
S. Mehdi Hashemi ◽  
Ebrahim Nasrabadi

Sign in / Sign up

Export Citation Format

Share Document