Minimum cost time-varying network flow problems

2010 ◽  
Vol 25 (3) ◽  
pp. 429-447 ◽  
Author(s):  
Ebrahim Nasrabadi ◽  
S. Mehdi Hashemi
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.


Networks ◽  
2007 ◽  
Vol 50 (1) ◽  
pp. 67-76 ◽  
Author(s):  
Dalila B.M.M. Fontes ◽  
José Fernando Gonçalves

2012 ◽  
Vol 19 (1) ◽  
pp. 1-33 ◽  
Author(s):  
Marta S. R. Monteiro ◽  
Dalila B. M. M. Fontes ◽  
Fernando A. C. C. Fontes

Sign in / Sign up

Export Citation Format

Share Document