Linear Max-Min Fairness in Multi-commodity Flow Networks

Author(s):  
Hamoud Bin Obaid ◽  
Theodore B. Trafalis
Keyword(s):  
2018 ◽  
Vol 22 (7) ◽  
pp. 1478-1481 ◽  
Author(s):  
Jianwei Zhang ◽  
Xinchang Zhang ◽  
Meng Sun ◽  
Chunling Yang

Author(s):  
Abhijin Adiga ◽  
Nicholas Palmer ◽  
Sanchit Sinha ◽  
Penina Waghalter ◽  
Aniruddha Dave ◽  
...  

2004 ◽  
Vol 29 (2) ◽  
pp. 280-288 ◽  
Author(s):  
Refael Hassin ◽  
Asaf Levin
Keyword(s):  

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.


2020 ◽  
Vol 53 (2) ◽  
pp. 7386-7391
Author(s):  
Luca De Cicco ◽  
Gioacchino Manfredi ◽  
Vittorio Palmisano ◽  
Saverio Mascolo

2014 ◽  
Vol 9 (10) ◽  
pp. 105010 ◽  
Author(s):  
Etienne Godin ◽  
Daniel Fortier ◽  
Stéphanie Coulombe
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document