Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems
Tsinghua Science and Technology · 2023-10 · 28 (5) · 916-928
DOI: 10.26599/tst.2022.9010052 ↗Kurz gefasst
Fachartikel in der Zeitschrift Tsinghua Science and Technology, 2023-10. Verfasst von Wei Yu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 32 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Shanghai.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Shanghai
Zitieren
APA
Yu, W., Liao, Y., & Yang, Y. (2023). Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems. Tsinghua Science and Technology, 28(5), 916-928. https://doi.org/10.26599/tst.2022.9010052
Vancouver
Yu W, Liao Y, Yang Y. Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems. Tsinghua Science and Technology. 2023;28(5):916-928. doi:10.26599/tst.2022.9010052
BibTeX
@article{Yu2023,
author = {Yu, Wei and Liao, Yujie and Yang, Yichen},
title = {Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems},
journal = {Tsinghua Science and Technology},
year = {2023},
volume = {28},
number = {5},
pages = {916--928},
doi = {10.26599/tst.2022.9010052}
}
EUVIMED