Geodesic
An upper bound for the shortest hamiltonian path in the symmetric euclidean case
RAIRO - Operations Research - Recherche Opérationnelle, Tome 17 (1983) no. 3, pp. 297-306
Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{RO_1983__17_3_297_0,
     author = {Tomescu, Ioan},
     title = {An upper bound for the shortest hamiltonian path in the symmetric euclidean case},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {297--306},
     year = {1983},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {3},
     mrnumber = {727267},
     zbl = {0524.05042},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RO_1983__17_3_297_0/}
}
TY  - JOUR
AU  - Tomescu, Ioan
TI  - An upper bound for the shortest hamiltonian path in the symmetric euclidean case
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1983
SP  - 297
EP  - 306
VL  - 17
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_1983__17_3_297_0/
LA  - en
ID  - RO_1983__17_3_297_0
ER  - 
%0 Journal Article
%A Tomescu, Ioan
%T An upper bound for the shortest hamiltonian path in the symmetric euclidean case
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1983
%P 297-306
%V 17
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_1983__17_3_297_0/
%G en
%F RO_1983__17_3_297_0
Tomescu, Ioan. An upper bound for the shortest hamiltonian path in the symmetric euclidean case. RAIRO - Operations Research - Recherche Opérationnelle, Tome 17 (1983) no. 3, pp. 297-306. http://geodesic.mathdoc.fr/item/RO_1983__17_3_297_0/