NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS

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.

KETABI SAEIDEH

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

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE Year:2006 | Volume:30 | Issue:A3 Page(s): 315-323

Download Full-Text

Persian Verion

View:

837

Download:

212

Cites:

Information Journal Paper

Title

NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS

Author(s)

KETABI SAEIDEH | Issue Writer Certificate

Keywords

MULTI-COMMODITY NETWORK FLOW PROBLEMQ3

PIECEWISE LINEAR AND CONVEX COSTSQ3

ARC-PATH MODELQ3

OVERFLOW MODELQ3

FRANK AND WOLFE METHODQ3

Abstract

The problem of finding the minimum cost multi-commodity flow in an undirected and complete network is studied when the link costs are piecewise linear and convex. The ARC-PATH MODEL and OVERFLOW MODEL are presented to formulate the problem. The results suggest that the new OVERFLOW MODEL outperforms the classical ARC-PATH MODEL for this problem. The classical revised simplex, Frank and Wolf and a heuristic method are compared for the problem.

Cites

No record.

References

No record.

Cite

APA: Copy

KETABI, SAEIDEH. (2006). NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE, 30(A3), 315-323. SID. https://sid.ir/paper/117899/en

Vancouver: Copy

KETABI SAEIDEH. NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE[Internet]. 2006;30(A3):315-323. Available from: https://sid.ir/paper/117899/en

IEEE: Copy

SAEIDEH KETABI, “NETWORK OPTIMIZATION WITH PIECEWISE LINEAR CONVEX COSTS,” IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE, vol. 30, no. A3, pp. 315–323, 2006, [Online]. Available: https://sid.ir/paper/117899/en

Related Journal Papers