The maximum flow problem of uncertain random network-Reference-Cited by-同舟云学术

The maximum flow problem of uncertain random network

Published:2017-04-28 Issue:5 Volume:8 Page:667-675
ISSN:1868-5137
Container-title:Journal of Ambient Intelligence and Humanized Computing
language:en
Short-container-title:J Ambient Intell Human Comput

Author:

Shi Gang,Sheng Yuhong,Ralescu Dan A.

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/article/10.1007/s12652-017-0495-3/fulltext.html

Reference43 articles.

1. Chen X, Gao J (2013) Uncertain term structure model of interest rate. Soft Comput 17(4):597–604

2. Carey M, Henrickson C (1984) Bounds on expected performance of networks with links subject to failure. Networks 14(3):439–456

3. Dinic EA (1970) Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math Dokl 11(8):1277–1280

4. Ding S (2015) The α-maximum flow model with uncertain capacities. Appl Math Model 39(7):2056–2063

5. Doulliez P (1971) Probability distribution function for the capacity of a multiterminal network. Revue Francaise d’Informatique et de Recherche Operationnelle 1(5):39–49

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum flow in hybrid network with intermediate storage;OPSEARCH;2024-07-20

2. Mobile chargers scheduling algorithm for maximum data flow in wireless sensor networks;Journal of Computational Methods in Sciences and Engineering;2023-05-30

3. A new uncertain multi-objective programming model with chance-entropy constraint for advertising promotion;Journal of Ambient Intelligence and Humanized Computing;2023-05-22

4. Risk‐averse optimization and resilient network flows;Networks;2023-05-13

5. An intelligent node labelling maximum flow algorithm;International Journal of System Assurance Engineering and Management;2023-05-06