THE MINIMUM UNIVERSAL COST FLOW IN AN INFEASIBLE FLOW NETWORK

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.; BAGHERIAN M.

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

Journal Paper

Paper Information

Journal: Journal of Sciences, Islamic Republic of Iran Year:2006 | Volume:17 | Issue:2 Page(s): 175-180

Download Full-Text

View:

340

Download:

118

Cites:

Information Journal Paper

Title

THE MINIMUM UNIVERSAL COST FLOW IN AN INFEASIBLE FLOW NETWORK

Author(s)

SALEHI FATHABADI H. | BAGHERIAN M. | Issue Writer Certificate

Keywords

MINIMUM COST NETWORK FLOW PROBLEM

INFEASIBLE FLOW NETWORK

Abstract

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an INFEASIBLE FLOW NETWORK is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the
MUCF.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SALEHI FATHABADI, H., & BAGHERIAN, M.. (2006). THE MINIMUM UNIVERSAL COST FLOW IN AN INFEASIBLE FLOW NETWORK. JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN, 17(2), 175-180. SID. https://sid.ir/paper/542172/en

Vancouver: Copy

SALEHI FATHABADI H., BAGHERIAN M.. THE MINIMUM UNIVERSAL COST FLOW IN AN INFEASIBLE FLOW NETWORK. JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN[Internet]. 2006;17(2):175-180. Available from: https://sid.ir/paper/542172/en

IEEE: Copy

H. SALEHI FATHABADI, and M. BAGHERIAN, “THE MINIMUM UNIVERSAL COST FLOW IN AN INFEASIBLE FLOW NETWORK,” JOURNAL OF SCIENCES ISLAMIC REPUBLIC OF IRAN, vol. 17, no. 2, pp. 175–180, 2006, [Online]. Available: https://sid.ir/paper/542172/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops