Geodesic
The complexity of optimal recombination for the traveling salesman problem
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 27-40

Voir la notice de l'article provenant de la source Math-Net.Ru

The computational complexity of optimal recombination for the traveling salesman problem is considered in the symmetric and general cases. NP-hardness of these problems is proven and some approaches to their solution are indicated. Ill. 3, bibliogr. 15.
Keywords: traveling salesman problem, genetic algorithm, optimal recombination, computational complexity
Mots-clés : problem transformation. 
@article{DA_2011_18_1_a3,
     author = {A. V. Eremeev},
     title = {The complexity of optimal recombination for the traveling salesman problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {27--40},
     publisher = {mathdoc},
     volume = {18},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_1_a3/}
}
TY  - JOUR
AU  - A. V. Eremeev
TI  - The complexity of optimal recombination for the traveling salesman problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 27
EP  - 40
VL  - 18
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_1_a3/
LA  - ru
ID  - DA_2011_18_1_a3
ER  - 
%0 Journal Article
%A A. V. Eremeev
%T The complexity of optimal recombination for the traveling salesman problem
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 27-40
%V 18
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_1_a3/
%G ru
%F DA_2011_18_1_a3
A. V. Eremeev. The complexity of optimal recombination for the traveling salesman problem. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 27-40. http://geodesic.mathdoc.fr/item/DA_2011_18_1_a3/