Open Access · CC BY 4.0
The non-disjoint Clustered Traveling Salesperson Problem
Computers & Operations Research · 2026-10 · 194 · 107557
DOI: 10.1016/j.cor.2026.107557 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-10. Verfasst von Felix Weidinger und 1 weiteren Autor:innen. Die Arbeit nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Weidinger, F., & Braekers, K. (2026). The non-disjoint Clustered Traveling Salesperson Problem. Computers & Operations Research, 194, 107557. https://doi.org/10.1016/j.cor.2026.107557
Vancouver
Weidinger F, Braekers K. The non-disjoint Clustered Traveling Salesperson Problem. Computers & Operations Research. 2026;194:107557. doi:10.1016/j.cor.2026.107557
BibTeX
@article{Weidinger2026,
author = {Weidinger, Felix and Braekers, Kris},
title = {The non-disjoint Clustered Traveling Salesperson Problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {194},
pages = {107557},
doi = {10.1016/j.cor.2026.107557}
}
EUVIMED