Large-Scale Topology Optimization in Fluid Flow Problems

2016 ◽  
Vol 2016.26 (0) ◽  
pp. 2310
Author(s):  
Kentaro YAJI ◽  
Masao OGINO ◽  
Shinji NISHIWAKI ◽  
Kikuo FUJITA
2007 ◽  
Vol 35 (2) ◽  
pp. 175-180 ◽  
Author(s):  
Niels Aage ◽  
Thomas H. Poulsen ◽  
Allan Gersborg-Hansen ◽  
Ole Sigmund

2015 ◽  
Vol 222 ◽  
pp. 82-95 ◽  
Author(s):  
Wen-Jing Yang ◽  
Wei Yi ◽  
Xiao-Guang Ren ◽  
Li-Yang Xu ◽  
Xin-Hai Xu ◽  
...  

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.


2021 ◽  
Vol 157-158 ◽  
pp. 103006
Author(s):  
David Herrero-Pérez ◽  
Pedro J. Martínez Castejón

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 56604-56615
Author(s):  
Manolo D'orto ◽  
Svante Sjoblom ◽  
Lung Sheng Chien ◽  
Lilit Axner ◽  
Jing Gong

Sign in / Sign up

Export Citation Format

Share Document