MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' 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.

SALEHI FATHABADI H.; RAYAT PANAH M.A.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2008 | Volume:18 | Issue:67-E Page(s): 7-15

Download Full-Text

Persian Verion

View:

1,582

Download:

Cites:

Information Journal Paper

Title

MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW

Author(s)

SALEHI FATHABADI H. | RAYAT PANAH M.A. | Issue Writer Certificate

Keywords

NETWORK FLOWQ3

NETWORK SIMPLEX ALGORITHMQ3

BASE TREEQ3

INCIDENCE MATRIXQ3

Abstract

In this paper the minimum cost flow problem with additional linear constraints on some arcs' flows has been considered. The additional constraints show that the flow on arcs which are belonged to specific subsets of arcs have to be linearly depended on the flow on a specific arc(called reference arc) in the subset. Since the basis structure in this problem is not a spanning tree, we introduce a basis spanning graph and call it a good (q+1)-forest for the problem. Then by regarding the optimality conditions, we restructure the NETWORK SIMPLEX ALGORITHM to solve the above problem.

Cites

No record.

References

No record.

Cite

APA: Copy

SALEHI FATHABADI, H., & RAYAT PANAH, M.A.. (2008). MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW. AMIRKABIR, 18(67-E), 7-15. SID. https://sid.ir/paper/797/en

Vancouver: Copy

SALEHI FATHABADI H., RAYAT PANAH M.A.. MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW. AMIRKABIR[Internet]. 2008;18(67-E):7-15. Available from: https://sid.ir/paper/797/en

IEEE: Copy

H. SALEHI FATHABADI, and M.A. RAYAT PANAH, “MINIMUM COST NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR RELATION BETWEEN ARCS' FLOW,” AMIRKABIR, vol. 18, no. 67-E, pp. 7–15, 2008, [Online]. Available: https://sid.ir/paper/797/en

Related Journal Papers