Effciency Analysis of the Vertex Clustering in Solving the Traveling Salesman Problem
Annales mathematicae et informaticae, Tome 48 (2018), pp. 33-42
Cet article a éte moissonné depuis la source Annales Mathematica et Informaticae website
@article{AMI_2018_48_a3,
author = {L\'aszl\'o Kov\'acs and Anita Ag\'ardi and B\'alint Debreceni},
title = {Effciency {Analysis} of the {Vertex} {Clustering} in {Solving} the {Traveling} {Salesman} {Problem}},
journal = {Annales mathematicae et informaticae},
pages = {33--42},
year = {2018},
volume = {48},
language = {en},
url = {http://geodesic.mathdoc.fr/item/AMI_2018_48_a3/}
}
TY - JOUR AU - László Kovács AU - Anita Agárdi AU - Bálint Debreceni TI - Effciency Analysis of the Vertex Clustering in Solving the Traveling Salesman Problem JO - Annales mathematicae et informaticae PY - 2018 SP - 33 EP - 42 VL - 48 UR - http://geodesic.mathdoc.fr/item/AMI_2018_48_a3/ LA - en ID - AMI_2018_48_a3 ER -
László Kovács; Anita Agárdi; Bálint Debreceni. Effciency Analysis of the Vertex Clustering in Solving the Traveling Salesman Problem. Annales mathematicae et informaticae, Tome 48 (2018), pp. 33-42. http://geodesic.mathdoc.fr/item/AMI_2018_48_a3/