A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
Computers & Operations Research · 2024-12 · 172 · 106807
DOI: 10.1016/j.cor.2024.106807 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2024-12. Verfasst von Jiachen Wei und 2 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Fundamental Research Funds for the Central Universities
- National Natural Science Foundation of China
Zitieren
APA
Wei, J., Poon, M., & Zhang, Z. (2024). A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions. Computers & Operations Research, 172, 106807. https://doi.org/10.1016/j.cor.2024.106807
Vancouver
Wei J, Poon M, Zhang Z. A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions. Computers & Operations Research. 2024;172:106807. doi:10.1016/j.cor.2024.106807
BibTeX
@article{Wei2024,
author = {Wei, Jiachen and Poon, Mark and Zhang, Zhenzhen},
title = {A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions},
journal = {Computers & Operations Research},
year = {2024},
volume = {172},
pages = {106807},
doi = {10.1016/j.cor.2024.106807}
}
EUVIMED