no. 3
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. 
@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},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {3},
     year = {1983},
     mrnumber = {727267},
     zbl = {0524.05042},
     language = {en},
     url = {http://archive.numdam.org/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://archive.numdam.org/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://archive.numdam.org/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://archive.numdam.org/item/RO_1983__17_3_297_0/

1. M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber and Schmidt, Boston, Massachusetts, 1979. | MR | Zbl

2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, The Macmillan Press, London, 1977. | MR

3. N. Christofides, The Shortest Hamiltonian Chain of a Graph, S.I.A.M. J. Appl. Math., Vol. 19, 1970, pp. 689-696. | MR | Zbl

4. N. Christofides, The Travelling Salesman Problem, CombinatoriaÏ Optimization, John Wiley, 1979, pp. 131-149. | Zbl

5. M. Held and R. M. Karp, The Travelling-Salesman Problem and Minimum Spanning Trees, Operations Research, Vol. 18, 1970, pp. 1138-1162. | MR | Zbl

6. D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis, An Analysis of Several Heuristics for the Traveling Salesman Problem, S.I.A.M. J. Comput., Vol. 6, No. 3, 1977, pp. 563-581. | MR | Zbl

7. I. Tomescu, Un algorithme pour l'obtention d'une chaîne hamiltonienne en partant de l'arbre minimal d'un graphe, R.A.I.R.O., V-3, Vol. 9, 1975, pp. 5-12. | Numdam | MR | Zbl