Free Access
RAIRO-Oper. Res.
Volume 19, Number 4, 1985
Page(s) 375 - 379
Published online 06 February 2017
  • 1. M. BRANDENBERGER, Generalized Network Generator, Institut pour l'Automation et la Recherche Opérationnelle, CH-1700 Fribourg, 1983. [Google Scholar]
  • 2. N. CHRISTOFIDES, The Travelling Salesman Problem, Report 77-11, Dept. of Management Science, Imperial College, London, 1977. [Zbl: 0415.90057] [Google Scholar]
  • 3. F. MATTHÄUS, Tourenplanung-Verfahren zur Einsatzdisposition von Fuhrparks, S. Toeche-Mittler Verlag, Darmstadt, 1978. [Google Scholar]
  • 4. D. J. ROSENKRANTZ, R. E. STEARNS et P. M. LEWIS, Approximate Algorithms for the T.S.P., Proc. 15th I.E.E.E. Symp. on Switching and Automata Theorey, 1974, p. 33. [MR: 424258] [Google Scholar]
  • 5. M. H. J. WEBB, Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities, Operational Research Quarterly, vol. 22, n° 1, 1971, p.49-66. [Zbl: 0216.26703] [Google Scholar]

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.