THE GENERAL EQUAL ARCS FLOW IN THE MULTICOMMODITY NETWORK FLOW PROBLEM

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: JOURNAL OF SCIENCE (UNIVERSITY OF TEHRAN) (JSUT) Year:2006 | Volume:33 | Issue:3 (SECTION: MATHEMATICS) Page(s): 9-17

Download Full-Text

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

Persian Verion

View:

1,255

Download:

Cites:

Information Journal Paper

Title

THE GENERAL EQUAL ARCS FLOW IN THE MULTICOMMODITY NETWORK FLOW PROBLEM

Author(s)

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

Keywords

NETWORK FLOWSQ3

THE MULTICOMMODITY FLOWSQ3

LAGRANGIAN RELAXATIONQ3

NETWORK SIMPLEX ALGORITHMQ3

CONVEX COST FLOWQ3

Abstract

In this paper the multicommodity network flow problem with equal flow on some predetermined arcs is considered. The equal flow constraints require that the amounts of arcs flow of some commodities on some subsets of predetermined arcs are equal. For solving this problem, first, using the capacity allocation algorithm, we define a starting solution. Then by LAGRANGIAN RELAXATION technique on general constraints we find a lower bound on the objective function value. An upper bound is also found by using embedded network simplex method.Finally, the optimal or near optimal solution is found when the upper and lowers bounds are made close enough to each other.

Cites

No record.

References

No record.

Cite

APA: Copy

SALEHI FATHABADI, H., & RAYAT PANAH, M.A.. (2006). THE GENERAL EQUAL ARCS FLOW IN THE MULTICOMMODITY NETWORK FLOW PROBLEM. JOURNAL OF SCIENCE (UNIVERSITY OF TEHRAN) (JSUT), 33(3 (SECTION: MATHEMATICS)), 9-17. SID. https://sid.ir/paper/2228/en

Vancouver: Copy

SALEHI FATHABADI H., RAYAT PANAH M.A.. THE GENERAL EQUAL ARCS FLOW IN THE MULTICOMMODITY NETWORK FLOW PROBLEM. JOURNAL OF SCIENCE (UNIVERSITY OF TEHRAN) (JSUT)[Internet]. 2006;33(3 (SECTION: MATHEMATICS)):9-17. Available from: https://sid.ir/paper/2228/en

IEEE: Copy

H. SALEHI FATHABADI, and M.A. RAYAT PANAH, “THE GENERAL EQUAL ARCS FLOW IN THE MULTICOMMODITY NETWORK FLOW PROBLEM,” JOURNAL OF SCIENCE (UNIVERSITY OF TEHRAN) (JSUT), vol. 33, no. 3 (SECTION: MATHEMATICS), pp. 9–17, 2006, [Online]. Available: https://sid.ir/paper/2228/en

Related Journal Papers