An Empirical Study of the Quality of the Cycle Merging Algorithm for the Maximum Traveling Salesman Problem
Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" · 2026 · 19 (1)
DOI: 10.14529/mmp260109 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", 2026. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
(2026). An Empirical Study of the Quality of the Cycle Merging Algorithm for the Maximum Traveling Salesman Problem. Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software", 19(1). https://doi.org/10.14529/mmp260109
Vancouver
An Empirical Study of the Quality of the Cycle Merging Algorithm for the Maximum Traveling Salesman Problem. Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software". 2026;19(1). doi:10.14529/mmp260109
BibTeX
@article{euvimed2026,
title = {An Empirical Study of the Quality of the Cycle Merging Algorithm for the Maximum Traveling Salesman Problem},
journal = {Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software"},
year = {2026},
volume = {19},
number = {1},
doi = {10.14529/mmp260109}
}
EUVIMED