PARALLEL BRANCH AND CUT FOR CAPACITATED VEHICLE ROUTING

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.

RALPHS T.K.

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

Journal Paper

Paper Information

Journal: PARALLEL COMPUTING Year:2003 | Volume:29 | Issue:5 Page(s): 607-629

Download Full-Text

View:

146

Download:

Cites:

Information Journal Paper

Title

PARALLEL BRANCH AND CUT FOR CAPACITATED VEHICLE ROUTING

Author(s)

RALPHS T.K. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

Cites

SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM

References

No record.

Cite

APA: Copy

RALPHS, T.K.. (2003). PARALLEL BRANCH AND CUT FOR CAPACITATED VEHICLE ROUTING. PARALLEL COMPUTING, 29(5), 607-629. SID. https://sid.ir/paper/619763/en

Vancouver: Copy

RALPHS T.K.. PARALLEL BRANCH AND CUT FOR CAPACITATED VEHICLE ROUTING. PARALLEL COMPUTING[Internet]. 2003;29(5):607-629. Available from: https://sid.ir/paper/619763/en

IEEE: Copy

T.K. RALPHS, “PARALLEL BRANCH AND CUT FOR CAPACITATED VEHICLE ROUTING,” PARALLEL COMPUTING, vol. 29, no. 5, pp. 607–629, 2003, [Online]. Available: https://sid.ir/paper/619763/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops