WEIGHTED OPTIMAL PATH IN GRAPH WITH MULTIPLE INDEXES

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.

NIKJOO M.; REZAI BALF F.

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

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2016 | Volume:2 | Issue:7 Page(s): 5-12

Download Full-Text

Persian Verion

View:

817

Download:

Cites:

Information Journal Paper

Title

WEIGHTED OPTIMAL PATH IN GRAPH WITH MULTIPLE INDEXES

Author(s)

NIKJOO M. | REZAI BALF F. | Issue Writer Certificate

Keywords

GRAPHQ1

PATHQ1

DATA ENVELOPMENT ANALYSISQ2

WEIGHT RESTRICTIONSQ1

Abstract

This paper represents a technique for finding optimal PATHs with multiple indexes in a GRAPH. Up to the present time, all optimal PATHs have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal PATH. Here, we use DATA ENVELOPMENT ANALYSIS (DEA) technique for designing a model that can identify optimal PATHs with multiple indexes, and separate them from the other PATHs.

Cites

No record.

References

No record.

Cite

APA: Copy

NIKJOO, M., & REZAI BALF, F.. (2016). WEIGHTED OPTIMAL PATH IN GRAPH WITH MULTIPLE INDEXES. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 2(7), 5-12. SID. https://sid.ir/paper/257303/en

Vancouver: Copy

NIKJOO M., REZAI BALF F.. WEIGHTED OPTIMAL PATH IN GRAPH WITH MULTIPLE INDEXES. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2016;2(7):5-12. Available from: https://sid.ir/paper/257303/en

IEEE: Copy

M. NIKJOO, and F. REZAI BALF, “WEIGHTED OPTIMAL PATH IN GRAPH WITH MULTIPLE INDEXES,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 2, no. 7, pp. 5–12, 2016, [Online]. Available: https://sid.ir/paper/257303/en

Related Journal Papers