Free Access
Issue
RAIRO-Oper. Res.
Volume 17, Number 3, 1983
Page(s) 297 - 306
DOI https://doi.org/10.1051/ro/1983170302971
Published online 06 February 2017
  • 1. M. BEHZAD, G. CHARTRAND and L. LESNIAK-FOSTER, Graphs and Digraphs, Prindle, Weber and Schmidt, Boston, Massachusetts, 1979. [MR: 525578] [Zbl: 0403.05027]
  • 2. J. A. BONDY and U. S. R. MURTY, Graph Theory with Applications, The Macmillan Press, London, 1977. [Zbl: 1226.05083] [MR: 411988]
  • 3. N. CHRISTOFIDES, The Shortest Hamiltonian Chain of a Graph, S.I.A.M. J. Appl. Math., Vol. 19, 1970, pp. 689-696. [MR: 274332] [Zbl: 0214.23403]
  • 4. N. CHRISTOFIDES, The Travelling Salesman Problem, CombinatoriaÏ Optimization, John Wiley, 1979, pp. 131-149. [Zbl: 0415.90057]
  • 5. M. HELD and R. M. KARP, The Travelling-Salesman Problem and Minimum Spanning Trees, Operations Research, Vol. 18, 1970, pp. 1138-1162. [MR: 278710] [Zbl: 0226.90047]
  • 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: 459617] [Zbl: 0364.90104]
  • 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. [EuDML: 104625] [MR: 441774] [Zbl: 0322.05129]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.