FINDING SHORTEST PATH IN A NETWORK: MULTIPLE OBJECTIVE MINIMUM COST 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.

DAVOODI ALIREZA

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE OF IRANIAN OPERATIONS RESEARCH SOCIETY
Year:2008 | Issue:1

Download Full-Text

View:

135

Download:

Information Seminar Paper

Title

FINDING SHORTEST PATH IN A NETWORK: MULTIPLE OBJECTIVE MINIMUM COST PROBLEM

Author(s)

DAVOODI ALIREZA | Issue Writer Certificate

Keywords

NETWORK FLOWS PROBLEM

MULTIPLE OBJECTIVE PROGRAMMING

DATA ENVELOPMENT ANALYSIS

Abstract

THE SHORTEST PATH PROBLEM IS AN INTERESTING SUBJECT IN NETWORK FLOWS PROBLEMS. SOME METHODS HAVE BEEN PRESENTED TO SOLVE THIS PROBLEM. BUT IF THERE ARE MULTIPLE TYPES OF COST INSTEAD OF ONE TYPE, SOLVING THIS PROBLEM IS NOT SIMPLE. IN FACT IN THIS CASE THE NON DOMINATED PATH PLAYS THE ROLL OF SHORTEST PATH. AN APPROACH IS INTRODUCED IN THIS PAPER DETERMINING THE NON DOMINATED PATH BETWEEN EVERY PAIR OF NODES IN A NETWORK.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

DAVOODI, ALIREZA. (2008). FINDING SHORTEST PATH IN A NETWORK: MULTIPLE OBJECTIVE MINIMUM COST PROBLEM. INTERNATIONAL CONFERENCE OF IRANIAN OPERATIONS RESEARCH SOCIETY. SID. https://sid.ir/paper/905431/en

Vancouver: Copy

DAVOODI ALIREZA. FINDING SHORTEST PATH IN A NETWORK: MULTIPLE OBJECTIVE MINIMUM COST PROBLEM. 2008. Available from: https://sid.ir/paper/905431/en

IEEE: Copy

ALIREZA DAVOODI, “FINDING SHORTEST PATH IN A NETWORK: MULTIPLE OBJECTIVE MINIMUM COST PROBLEM,” presented at the INTERNATIONAL CONFERENCE OF IRANIAN OPERATIONS RESEARCH SOCIETY. 2008, [Online]. Available: https://sid.ir/paper/905431/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops