Geodesic
Effciency Analysis of the Vertex Clustering in Solving the Traveling Salesman Problem
Annales mathematicae et informaticae, Tome 48 (2018), pp. 33-42 
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/
@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  - 
%0 Journal Article
%A László Kovács
%A Anita Agárdi
%A Bálint Debreceni
%T Effciency Analysis of the Vertex Clustering in Solving the Traveling Salesman Problem
%J Annales mathematicae et informaticae
%D 2018
%P 33-42
%V 48
%U http://geodesic.mathdoc.fr/item/AMI_2018_48_a3/
%G en
%F AMI_2018_48_a3

Voir la notice de l'article provenant de la source Annales Mathematica et Informaticae website