EUVIMEDEUVIMED entdecken
Crossref

Code and Data for A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows

Tayeb Mhamedi, Marilène Cherkesly, Guy Desaulniers

INFORMS Journal on Computing · 28.04.2026

DOI: 10.1287/ijoc.2024.1010.cd ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 28.04.2026. Verfasst von Tayeb Mhamedi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Mhamedi, T., Cherkesly, M., & Desaulniers, G. (2026). Code and Data for A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2024.1010.cd

Vancouver

Mhamedi T, Cherkesly M, Desaulniers G. Code and Data for A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows. INFORMS Journal on Computing. 2026. doi:10.1287/ijoc.2024.1010.cd

BibTeX
@article{Mhamedi2026,
  author = {Mhamedi, Tayeb and Cherkesly, Marilène and Desaulniers, Guy},
  title = {Code and Data for A branch-price-and-cut algorithm for the multi-commodity two-echelon vehicle routing problem with time windows},
  journal = {INFORMS Journal on Computing},
  year = {2026},
  doi = {10.1287/ijoc.2024.1010.cd}
}
Kostenlos starten →