Minimizing the maximum network flow: models and algorithms with resource synergy considerations

2012 ◽  
Vol 63 (12) ◽  
pp. 1693-1707 ◽  
Author(s):  
B J Lunday ◽  
H D Sherali
Keyword(s):  
Network Flow ◽  
Flow Models ◽  
Network Flow Models ◽  
Maximum Network Flow

scholarly journals Optimum Flows in Directed Bipartite Dynamic Network. The Static Approach

2020 ◽  
Vol 14 ◽  
Keyword(s):  
Combinatorial Optimization ◽  
Network Flow ◽  
Dynamic Network ◽  
Time Varying ◽  
Flow Models ◽  
Dynamic Network Flow ◽  
Static Approach ◽  
Network Flow Models ◽  
Discrete Values ◽  
Time Expanded Network

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.

scholarly journals Comparison of the performance of four Eulerian network flow models for strategic air traffic management

2007 ◽  
Vol 2 (4) ◽  
pp. 569-595 ◽  
Author(s):  
Dengfeng Sun ◽  
◽  
Issam S. Strub ◽  
Alexandre M. Bayen ◽  
◽  
...  
Keyword(s):  
Network Flow ◽  
Traffic Management ◽  
Air Traffic Management ◽  
Air Traffic ◽  
Flow Models ◽  
Network Flow Models

Fair internet traffic integration: network flow models and analysis

2004 ◽  
Vol 59 (11-12) ◽  
pp. 1338-1352
Author(s):  
Peter Key ◽  
Laurent Massoulié ◽  
Alan Bain ◽  
Frank Kelly
Keyword(s):  
Network Flow ◽  
Internet Traffic ◽  
Flow Models ◽  
Network Flow Models
Sign in / Sign up

Export Citation Format

Share Document