scholarly journals Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

1988 ◽  
Vol 36 (1) ◽  
pp. 93-114 ◽  
Author(s):  
Dimitri P. Bertsekas ◽  
Paul Tseng
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Network Flow Problems ◽  
Relaxation Methods ◽  
Flow Problems ◽  
Generalized Network Flow

scholarly journals Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Random Network ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Network Flow Problems ◽  
Commodity Flow ◽  
Vast Number ◽  
Flow Problems ◽  
Execution Speed

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.

Minimum cost time-varying network flow problems

2010 ◽  
Vol 25 (3) ◽  
pp. 429-447 ◽  
Author(s):  
Ebrahim Nasrabadi ◽  
S. Mehdi Hashemi
Keyword(s):  
Network Flow ◽  
Minimum Cost ◽  
Time Varying ◽  
Network Flow Problems ◽  
Flow Problems
Sign in / Sign up

Export Citation Format

Share Document