COMPUTING THE RELIABILITY OF THE MULTI-COMMODITY RANDOM NETWORKS FLOW

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SOLTANIFAR M.; EBRAHIMNEJAD A.; SHAHGHOBADI S.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2013 | Volume:10 | Issue:3 (38) Page(s): 71-81

Download Full-Text

Persian Verion

View:

993

Download:

Cites:

Information Journal Paper

Title

COMPUTING THE RELIABILITY OF THE MULTI-COMMODITY RANDOM NETWORKS FLOW

Author(s)

SOLTANIFAR M. | EBRAHIMNEJAD A. | SHAHGHOBADI S. | Issue Writer Certificate

Keywords

RANDOM NETWORKS FLOWQ2

MINIMAL PATHQ2

MINIMAL CUTQ2

RELIABILITYQ2

Abstract

In the single-commodity networks, the capacity of a system is defined as the maximum amount of posted flow from source to destination. Obviously, the capacity of aexact network flow is constant but for a random network flow (a network in which the capacity of each arc is a random value) is varies. Therefore, it is necessary to calculate the RELIABILITY of the system. This calculation is done in two ways: the probability of the capacity of the system greater or less than D, where D is a vector of fixed capacity. These two methods according to MINIMAL PATHs and MINIMAL CUTs are calculated, respectively. In this paper, after introducing the flow allocation, using the properties of MINIMAL CUT an efficient algorithm is proposed to compute the RELIABILITY of the system in general. This algorithm is more efficient in comparison with other methods and algorithms which do not use the MINIMAL CUTs.

Cites

No record.

References

Cite

APA: Copy

SOLTANIFAR, M., EBRAHIMNEJAD, A., & SHAHGHOBADI, S.. (2013). COMPUTING THE RELIABILITY OF THE MULTI-COMMODITY RANDOM NETWORKS FLOW. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 10(3 (38)), 71-81. SID. https://sid.ir/paper/164736/en

Vancouver: Copy

SOLTANIFAR M., EBRAHIMNEJAD A., SHAHGHOBADI S.. COMPUTING THE RELIABILITY OF THE MULTI-COMMODITY RANDOM NETWORKS FLOW. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2013;10(3 (38)):71-81. Available from: https://sid.ir/paper/164736/en

IEEE: Copy

M. SOLTANIFAR, A. EBRAHIMNEJAD, and S. SHAHGHOBADI, “COMPUTING THE RELIABILITY OF THE MULTI-COMMODITY RANDOM NETWORKS FLOW,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 10, no. 3 (38), pp. 71–81, 2013, [Online]. Available: https://sid.ir/paper/164736/en

Related Journal Papers