Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

93
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

1

Information Journal Paper

Title

A BRANCH-AND-CUT-AND-PRICE ALGORITHM FOR THE MULTI-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Pages

  723-740

Keywords

Not Registered.

Abstract

Cites

References

  • No record.
  • Cite

    APA: Copy

    BETTINELLI, A., & CESELLI, A.. (2011). A BRANCH-AND-CUT-AND-PRICE ALGORITHM FOR THE MULTI-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. TRANSPORTATION RESEARCH PART C: EMERGING TECHNOLOGIES, 19(-), 723-740. SID. https://sid.ir/paper/630343/en

    Vancouver: Copy

    BETTINELLI A., CESELLI A.. A BRANCH-AND-CUT-AND-PRICE ALGORITHM FOR THE MULTI-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. TRANSPORTATION RESEARCH PART C: EMERGING TECHNOLOGIES[Internet]. 2011;19(-):723-740. Available from: https://sid.ir/paper/630343/en

    IEEE: Copy

    A. BETTINELLI, and A. CESELLI, “A BRANCH-AND-CUT-AND-PRICE ALGORITHM FOR THE MULTI-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOWS,” TRANSPORTATION RESEARCH PART C: EMERGING TECHNOLOGIES, vol. 19, no. -, pp. 723–740, 2011, [Online]. Available: https://sid.ir/paper/630343/en

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops






    مرکز اطلاعات علمی SID
    strs
    دانشگاه امام حسین
    بنیاد ملی بازیهای رایانه ای
    کلید پژوه
    ایران سرچ
    ایران سرچ
    File Not Exists.
    Move to top